Mike A. Steel

Orcid: 0000-0001-7015-4644

Affiliations:
  • University of Canterbury, Christchurch, New Zealand
  • University of Western Sydney, Australia


According to our database1, Mike A. Steel authored at least 83 papers between 1981 and 2022.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
An Autocatalytic Network Model of Conceptual Change.
Top. Cogn. Sci., 2022

2021
Combinatorics of Polymer-Based Models of Early Metabolism.
SIAM J. Discret. Math., 2021

The Expected Number of Viable Autocatalytic Sets in Chemical Reaction Systems.
Artif. Life, 2021

2020
Modeling a Cognitive Transition at the Origin of Cultural Evolution Using Autocatalytic Networks.
Cogn. Sci., 2020

2018
Combinatorial properties of triplet covers for binary trees.
Adv. Appl. Math., 2018

New characterisations of tree-based networks and proximity measures.
Adv. Appl. Math., 2018

2017
Nonbinary tree-based networks: characterisations, metrics, and support trees.
CoRR, 2017

Chasing the tail: The emergence of autocatalytic networks.
Biosyst., 2017

2016
Neighborhoods of Phylogenetic Trees: Exact and Asymptotic Counts.
SIAM J. Discret. Math., 2016

A navigation system for tree space.
J. Graph Algorithms Appl., 2016

A 'Stochastic Safety Radius' for Distance-Based Tree Reconstruction.
Algorithmica, 2016

Phylogeny - discrete and random processes in evolution.
CBMS-NSF regional conference series in applied mathematics 89, SIAM, ISBN: 978-1-61197-447-8, 2016

2015
Bounds on the Expected Size of the Maximum Agreement Subtree.
SIAM J. Discret. Math., 2015

Which phylogenetic networks are merely trees with additional arcs?
CoRR, 2015

Algorithms for detecting and analysing autocatalytic sets.
Algorithms Mol. Biol., 2015

The structure of symmetric <i>n</i>-player games when influence and independence collide.
Adv. Appl. Math., 2015

2014
Tracing Evolutionary Links between Species.
Am. Math. Mon., 2014

A matroid associated with a phylogenetic tree.
Discret. Math. Theor. Comput. Sci., 2014

Likelihood-based tree reconstruction on a concatenation of alignments can be positively misleading.
CoRR, 2014

Tree Reconstruction from Triplet Cover Distances.
Electron. J. Comb., 2014

2012
Trait-Dependent Extinction Leads to Greater Expected Biodiversity Loss.
SIAM J. Discret. Math., 2012

'Bureaucratic' set systems, and their role in phylogenetics.
Appl. Math. Lett., 2012

2011
The 'Butterfly effect' in Cayley graphs, and its relevance for evolutionary genomics
CoRR, 2011

'Lassoing' a phylogenetic tree I: Basic properties, shellings, and covers
CoRR, 2011

2010
Locating a tree in a phylogenetic network.
Inf. Process. Lett., 2010

Autocatalytic Sets and the Origin of Life.
Entropy, 2010

Characterizing phylogenetically decisive taxon coverage.
Appl. Math. Lett., 2010

The expected length of pendant and interior edges of a Yule tree.
Appl. Math. Lett., 2010

Logarithmic bounds on the posterior divergence time of two sequences.
Appl. Math. Lett., 2010

2009
Refining Phylogenetic Trees Given Additional Data: An Algorithm Based on Parsimony.
IEEE ACM Trans. Comput. Biol. Bioinform., 2009

Shrinkage Effect in Ancestral Maximum Likelihood.
IEEE ACM Trans. Comput. Biol. Bioinform., 2009

Special Section: Phylogenetics.
IEEE ACM Trans. Comput. Biol. Bioinform., 2009

Computing the Distribution of a Tree Metric.
IEEE ACM Trans. Comput. Biol. Bioinform., 2009

An improved bound on the maximum agreement subtree problem.
Appl. Math. Lett., 2009

Markovian log-supermodularity, and its applications in phylogenetics.
Appl. Math. Lett., 2009

A Hall-type theorem for triplet set systems based on medians in trees.
Appl. Math. Lett., 2009

2008
A regular decomposition of the edge-product space of phylogenetic trees.
Adv. Appl. Math., 2008

2007
Teasing Apart Two Trees.
Comb. Probab. Comput., 2007

How much can evolved characters tell us about the tree that generated them?
Proceedings of the Mathematics of Evolution and Phylogeny., 2007

2006
Unicyclic Networks: Compatibility and Enumeration.
IEEE ACM Trans. Comput. Biol. Bioinform., 2006

Identifying X-Trees with Few Characters.
Electron. J. Comb., 2006

Reducing Distortion in Phylogenetic Networks.
Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006

2005
Four Characters Suffice to Convexly Define a Phylogenetic Tree.
SIAM J. Discret. Math., 2005

Recovering a phylogenetic tree using pairwise closure operations.
Appl. Math. Lett., 2005

Reconstruction of Reticulate Networks from Gene Trees.
Proceedings of the Research in Computational Molecular Biology, 2005

2004
Phylogenetic Super-Networks from Partial Trees.
IEEE ACM Trans. Comput. Biol. Bioinform., 2004

Supertree algorithms for ancestral divergence dates and nested taxa.
Bioinform., 2004

Phylogenetic trees based on gene content.
Bioinform., 2004

Two further links between MP and ML under the poisson model.
Appl. Math. Lett., 2004

Cyclic permutations and evolutionary trees.
Adv. Appl. Math., 2004

Peeling phylogenetic 'oranges'.
Adv. Appl. Math., 2004

2002
Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications.
SIAM J. Discret. Math., 2002

A characterization for a set of partial partitions to define an <i>X</i>-tree.
Discret. Math., 2002

Tree Reconstruction from Multi-State Characters.
Adv. Appl. Math., 2002

2001
Sufficient Conditions for Two Tree Reconstruction Techniques to Succeed on Sufficiently Long Sequences.
SIAM J. Discret. Math., 2001

Constructing Optimal Trees from Quartets.
J. Algorithms, 2001

Applying the Thorne-Kishino-Felsenstein model to sequence evolution on a star-shaped tree.
Appl. Math. Lett., 2001

The size of a maximum agreement subtree for random binary trees.
Proceedings of the Bioconsensus, 2001

2000
Metrics on RNA Secondary Structures.
J. Comput. Biol., 2000

Algorithmic Aspects of Tree Amalgamation.
J. Algorithms, 2000

A supertree method for rooted trees.
Discret. Appl. Math., 2000

The Difficulty of Constructing a Leaf-labelled Tree Including or Avoiding Given Subtrees.
Discret. Appl. Math., 2000

The emergence of a self-catalysing structure in abstract origin-of-life models.
Appl. Math. Lett., 2000

Tree Reconstruction via a Closure Operation on Partial Splits.
Proceedings of the Computational Biology, 2000

1999
A Few Logs Suffice to Build (almost) All Trees: Part II.
Theor. Comput. Sci., 1999

A few logs suffice to build (almost) all trees (I).
Random Struct. Algorithms, 1999

Retractions of Finite Distance Functions Onto Tree Metrics.
Discret. Appl. Math., 1999

Fast Algorithms for Constructing Optimal Trees from Quartets.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998
Better Methods for Solving Parsimony and Compatibility.
J. Comput. Biol., 1998

Reconstructing Phylogenies From Nucleotide Pattern Probabilities: A Survey and some New Results.
Discret. Appl. Math., 1998

1997
The Length of a Leaf Coloration on a Random Binary Tree.
SIAM J. Discret. Math., 1997

Local Quartet Splits of a Binary Tree Infer All Quartet Splits Via One Dyadic Inference Rule.
Comput. Artif. Intell., 1997

Constructing Big Trees from Short Sequences.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996
Bounds on absorption times of directionally biased random sequences.
Random Struct. Algorithms, 1996

Dissimilarity maps and substitution models: Some new results.
Proceedings of the Mathematical Hierarchies and Biology, 1996

1995
Symmetric Matrices Representable by Weighted Trees Over a Cancellative Abelian Monoid.
SIAM J. Discret. Math., 1995

Pure adaptive search for finite global optimization.
Math. Program., 1995

Classifying and Counting Linear Phylogenetic Invariants for the Jukes-Cantor Model.
J. Comput. Biol., 1995

1994
Reconstructing Trees When Sequence Sites Evolve at Variable Rates.
J. Comput. Biol., 1994

1993
Kaikoura Tree Theorems: Computing the Maximum Agreement Subtree.
Inf. Process. Lett., 1993

Distributions on Bicoloured Binary Trees Arising from the Principle of Parsimony.
Discret. Appl. Math., 1993

1988
Distribution of the Symmetric Difference Metric on Phylogenetic Trees.
SIAM J. Discret. Math., 1988

1981
Automating the Restructuring of Network Data Bases.
Aust. Comput. J., 1981


  Loading...