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 treetree metriccircular orderingsdissimilarity maps

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15)

Related Items (25)

Optimality of the neighbor joining algorithm and faces of the balanced minimum evolution polytope ⋮ A branch-price-and-cut algorithm for the minimum evolution problem ⋮ Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves ⋮ A tutorial on the balanced minimum evolution problem ⋮ Robustness of phylogenetic inference based on minimum evolution ⋮ An information theory perspective on the balanced minimum evolution problem ⋮ Testing for phylogenetic signal in phenotypic traits: new matrices of phylogenetic proximities ⋮ A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem ⋮ A Linear In-situ Algorithm for the Power of Cyclic Permutation ⋮ Constructing circular phylogenetic networks from weighted quartets using simulated annealing ⋮ Approximating the balanced minimum evolution problem ⋮ UPGMA and the normalized equidistant minimum evolution problem ⋮ Affine and projective tree metric theorems ⋮ Split decomposition over an Abelian group. I: Generalities ⋮ Reconstructing a phylogenetic level-1 network from quartets ⋮ The neighbor-net algorithm ⋮ The minimum evolution problem: Overview and classification ⋮ Galois connections for phylogenetic networks and their polytopes ⋮ On the approximability of the fixed-tree balanced minimum evolution problem ⋮ Combinatorial properties of phylogenetic diversity indices ⋮ The Balanced Minimum Evolution Problem ⋮ Level-1 phylogenetic networks and their balanced minimum evolution polytopes ⋮ A five-element transformation monoid on labelled trees ⋮ An improved bound on the maximum agreement subtree problem ⋮ Neighborhoods of trees in circular orderings

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cyclic permutations and evolutionary trees