Cyclic permutations and evolutionary trees

DOI10.1016/S0196-8858(03)00098-8zbMath1050.05027MaRDI QIDQ1883411

Charles Semple, Mike A. Steel

Publication date: 12 October 2004

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

phylogenetic tree; tree metric; circular orderings; dissimilarity maps

Mathematics Subject Classification ID

05C05: Trees

92D15: Problems related to evolution

Related Items

The minimum evolution problem: Overview and classification, Constructing circular phylogenetic networks from weighted quartets using simulated annealing, The neighbor-net algorithm, Robustness of phylogenetic inference based on minimum evolution, Testing for phylogenetic signal in phenotypic traits: new matrices of phylogenetic proximities, Split decomposition over an Abelian group. I: Generalities, An improved bound on the maximum agreement subtree problem, A Linear In-situ Algorithm for the Power of Cyclic Permutation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The performance of neighbor-joining methods of phylogenetic reconstruction
• Retractions of finite distance functions onto tree metrics
• A note on the metric properties of trees
• A few logs suffice to build (almost) all trees. II
• The distance matrix of a graph and its tree realization
• A note on the tree realizability of a distance matrix