Mike A. Steel

Top. Cogn. Sci., 2022

Combinatorial and stochastic properties of ranked tree-child networks.

[BibT_eX]

[DOI]

François Bienvenu

Amaury Lambert

Random Struct. Algorithms, 2022

The Probability of Joint Monophyly of Samples of Gene Lineages for All Species in an Arbitrary Species Tree.

[BibT_eX]

[DOI]

Rohan S. Mehta

Noah A. Rosenberg

J. Comput. Biol., 2022

2021

Combinatorics of Polymer-Based Models of Early Metabolism.

[BibT_eX]

[DOI]

Oliver Weller-Davies

Jotun Hein

SIAM J. Discret. Math., 2021

The Expected Number of Viable Autocatalytic Sets in Chemical Reaction Systems.

[BibT_eX]

[DOI]

Stuart A. Kauffman

Artif. Life, 2021

2020

Modeling a Cognitive Transition at the Origin of Cultural Evolution Using Autocatalytic Networks.

[BibT_eX]

[DOI]

Liane Gabora

Cogn. Sci., 2020

2018

Combinatorial properties of triplet covers for binary trees.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2018

New characterisations of tree-based networks and proximity measures.

[BibT_eX]

[DOI]

Andrew R. Francis

Adv. Appl. Math., 2018

2017

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

[BibT_eX]

[DOI]

Joan Carles Pons

CoRR, 2017

Chasing the tail: The emergence of autocatalytic networks.

[BibT_eX]

[DOI]

Wim Hordijk

Biosyst., 2017

2016

Neighborhoods of Phylogenetic Trees: Exact and Asymptotic Counts.

[BibT_eX]

[DOI]

J. V. de Jong

Jeanette C. McLeod

SIAM J. Discret. Math., 2016

A navigation system for tree space.

[BibT_eX]

[DOI]

Sarah Mark

Jeanette C. McLeod

J. Graph Algorithms Appl., 2016

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

[BibT_eX]

[DOI]

Olivier Gascuel

Algorithmica, 2016

Phylogeny - discrete and random processes in evolution.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Daniel Irving Bernstein

SIAM J. Discret. Math., 2015

Which phylogenetic networks are merely trees with additional arcs?

[BibT_eX]

[DOI]

Andrew R. Francis

CoRR, 2015

Algorithms for detecting and analysing autocatalytic sets.

[BibT_eX]

[DOI]

Wim Hordijk

Joshua I. Smith

Algorithms Mol. Biol., 2015

The structure of symmetric <i>n</i>-player games when influence and independence collide.

[BibT_eX]

[DOI]

Denali Molitor

Amelia Taylor

Adv. Appl. Math., 2015

2014

Tracing Evolutionary Links between Species.

[BibT_eX]

[DOI]

Am. Math. Mon., 2014

A matroid associated with a phylogenetic tree.

[BibT_eX]

[DOI]

Andreas W. M. Dress

Discret. Math. Theor. Comput. Sci., 2014

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

[BibT_eX]

[DOI]

Sebastien Roch

CoRR, 2014

Tree Reconstruction from Triplet Cover Distances.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

2012

Trait-Dependent Extinction Leads to Greater Expected Biodiversity Loss.

[BibT_eX]

[DOI]

Beáta Faller

SIAM J. Discret. Math., 2012

'Bureaucratic' set systems, and their role in phylogenetics.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2012

2011

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

[BibT_eX]

[DOI]

CoRR, 2011

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

[BibT_eX]

[DOI]

Andreas W. M. Dress

CoRR, 2011

2010

Locating a tree in a phylogenetic network.

[BibT_eX]

[DOI]

Leo van Iersel

Inf. Process. Lett., 2010

Autocatalytic Sets and the Origin of Life.

[BibT_eX]

[DOI]

Wim Hordijk

Jotun Hein

Entropy, 2010

Characterizing phylogenetically decisive taxon coverage.

[BibT_eX]

[DOI]

Michael J. Sanderson

Appl. Math. Lett., 2010

The expected length of pendant and interior edges of a Yule tree.

[BibT_eX]

[DOI]

Arne Mooers

Appl. Math. Lett., 2010

Logarithmic bounds on the posterior divergence time of two sequences.

[BibT_eX]

[DOI]

Radu Mihaescu

Appl. Math. Lett., 2010

2009

Refining Phylogenetic Trees Given Additional Data: An Algorithm Based on Parsimony.

[BibT_eX]

[DOI]

Taoyang Wu

IEEE ACM Trans. Comput. Biol. Bioinform., 2009

Shrinkage Effect in Ancestral Maximum Likelihood.

[BibT_eX]

[DOI]

Elchanan Mossel

Sébastien Roch

IEEE ACM Trans. Comput. Biol. Bioinform., 2009

Special Section: Phylogenetics.

[BibT_eX]

[DOI]

Daniel H. Huson

IEEE ACM Trans. Comput. Biol. Bioinform., 2009

Computing the Distribution of a Tree Metric.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2009

An improved bound on the maximum agreement subtree problem.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2009

Markovian log-supermodularity, and its applications in phylogenetics.

[BibT_eX]

[DOI]

Beáta Faller

Appl. Math. Lett., 2009

A Hall-type theorem for triplet set systems based on medians in trees.

[BibT_eX]

[DOI]

Andreas W. M. Dress

Appl. Math. Lett., 2009

2008

A regular decomposition of the edge-product space of phylogenetic trees.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2008

2007

Teasing Apart Two Trees.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2007

How much can evolved characters tell us about the tree that generated them?

[BibT_eX]

Elchanan Mossel

Proceedings of the Mathematics of Evolution and Phylogeny., 2007

2006

Unicyclic Networks: Compatibility and Enumeration.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2006

Identifying X-Trees with Few Characters.

[BibT_eX]

[DOI]

Magnus Bordewich

Electron. J. Comb., 2006

Reducing Distortion in Phylogenetic Networks.

[BibT_eX]

[DOI]

Daniel H. Huson

Jim Whitfield

Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006

2005

Four Characters Suffice to Convexly Define a Phylogenetic Tree.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2005

Recovering a phylogenetic tree using pairwise closure operations.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2005

Reconstruction of Reticulate Networks from Gene Trees.

[BibT_eX]

[DOI]

Proceedings of the Research in Computational Molecular Biology, 2005

2004

Phylogenetic Super-Networks from Partial Trees.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2004

Supertree algorithms for ancestral divergence dates and nested taxa.

[BibT_eX]

[DOI]

Bioinform., 2004

Phylogenetic trees based on gene content.

[BibT_eX]

[DOI]

Daniel H. Huson

Bioinform., 2004

Two further links between MP and ML under the poisson model.

[BibT_eX]

[DOI]

David Penny

Appl. Math. Lett., 2004

Cyclic permutations and evolutionary trees.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2004

Peeling phylogenetic 'oranges'.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2004

2002

Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2002

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

[BibT_eX]

[DOI]

Discret. Math., 2002

Tree Reconstruction from Multi-State Characters.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2002

2001

Sufficient Conditions for Two Tree Reconstruction Techniques to Succeed on Sufficiently Long Sequences.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2001

Constructing Optimal Trees from Quartets.

[BibT_eX]

[DOI]

J. Algorithms, 2001

Applying the Thorne-Kishino-Felsenstein model to sequence evolution on a star-shaped tree.

[BibT_eX]

[DOI]

Jotun Hein

Appl. Math. Lett., 2001

The size of a maximum agreement subtree for random binary trees.

[BibT_eX]

[DOI]

Andy McKenzie

Proceedings of the Bioconsensus, 2001

2000

Metrics on RNA Secondary Structures.

[BibT_eX]

[DOI]

J. Comput. Biol., 2000

Algorithmic Aspects of Tree Amalgamation.

[BibT_eX]

[DOI]

J. Algorithms, 2000

A supertree method for rooted trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2000

The Difficulty of Constructing a Leaf-labelled Tree Including or Avoiding Given Subtrees.

[BibT_eX]

[DOI]

Meei Pyng Ng

Nicholas C. Wormald

Discret. Appl. Math., 2000

The emergence of a self-catalysing structure in abstract origin-of-life models.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2000

Tree Reconstruction via a Closure Operation on Partial Splits.

[BibT_eX]

[DOI]

Proceedings of the Computational Biology, 2000

1999

A Few Logs Suffice to Build (almost) All Trees: Part II.

[BibT_eX]

[DOI]

Péter L. Erdös

Tandy J. Warnow

Theor. Comput. Sci., 1999

A few logs suffice to build (almost) all trees (I).

[BibT_eX]

[DOI]

Péter L. Erdös

Tandy J. Warnow

Random Struct. Algorithms, 1999

Retractions of Finite Distance Functions Onto Tree Metrics.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

Fast Algorithms for Constructing Optimal Trees from Quartets.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998

Better Methods for Solving Parsimony and Compatibility.

[BibT_eX]

[DOI]

J. Comput. Biol., 1998

Reconstructing Phylogenies From Nucleotide Pattern Probabilities: A Survey and some New Results.

[BibT_eX]

[DOI]

Michael D. Hendy

David Penny

Discret. Appl. Math., 1998

1997

The Length of a Leaf Coloration on a Random Binary Tree.

[BibT_eX]

[DOI]

Angèle M. Hamel

SIAM J. Discret. Math., 1997

Local Quartet Splits of a Binary Tree Infer All Quartet Splits Via One Dyadic Inference Rule.

[BibT_eX]

[DOI]

Comput. Artif. Intell., 1997

Constructing Big Trees from Short Sequences.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996

Bounds on absorption times of directionally biased random sequences.

[BibT_eX]

[DOI]

William Baritompa

Random Struct. Algorithms, 1996

Dissimilarity maps and substitution models: Some new results.

[BibT_eX]

[DOI]

Chris Tuffley

Proceedings of the Mathematical Hierarchies and Biology, 1996

1995

Symmetric Matrices Representable by Weighted Trees Over a Cancellative Abelian Monoid.

[BibT_eX]

[DOI]

Hans-Jürgen Bandelt

SIAM J. Discret. Math., 1995

Pure adaptive search for finite global optimization.

[BibT_eX]

[DOI]

Math. Program., 1995

Classifying and Counting Linear Phylogenetic Invariants for the Jukes-Cantor Model.

[BibT_eX]

[DOI]

Y. X. Fu

J. Comput. Biol., 1995

1994

Reconstructing Trees When Sequence Sites Evolve at Variable Rates.

[BibT_eX]

[DOI]

Michael D. Hendy

J. Comput. Biol., 1994

1993

Kaikoura Tree Theorems: Computing the Maximum Agreement Subtree.

[BibT_eX]

[DOI]

Tandy J. Warnow

Inf. Process. Lett., 1993

Distributions on Bicoloured Binary Trees Arising from the Principle of Parsimony.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1993

1988

Distribution of the Symmetric Difference Metric on Phylogenetic Trees.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1988

1981

Automating the Restructuring of Network Data Bases.

[BibT_eX]