Minimizing phylogenetic number to find good evolutionary trees

DOI10.1016/S0166-218X(96)00060-1zbMath0880.92030OpenAlexW2089702026MaRDI QIDQ5961621

Elizabeth Sweedyk, Cynthia A. Phillips, Paul W. Goldberg, Leslie Ann Goldberg, Tandy J. Warnow

Publication date: 2 February 1998

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

evolutionary treesphylogenetic number

Mathematics Subject Classification ID

Problems related to evolution (92D15) Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Discrete mathematics in relation to computer science (68R99)

Related Items (6)

Efficient approximation of convex recolorings ⋮ A constructive algorithm for realizing a distance matrix ⋮ Improved approximation algorithm for convex recoloring of trees ⋮ Convex recolorings of strings and trees: Definitions, hardness results and algorithms ⋮ Character-based phylogeny construction and its application to tumor evolution ⋮ A colored graph approach to perfect phylogeny with persistent characters

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of reconstructing trees from qualitative characters and subtrees
• A characterisation of rigid circuit graphs
• Incidence matrices and interval graphs
• Triangulating Vertex-Colored Graphs
• Inferring Evolutionary History From DNA Sequences
• A Polynomial-Time Algorithm For the Perfect Phylogeny Problem When the Number of Character States is Fixed
• SIMPLE ALGORITHMS FOR PERFECT PHYLOGENY AND TRIANGULATING COLORED GRAPHS
• Two strikes against perfect phylogeny

This page was built for publication: Minimizing phylogenetic number to find good evolutionary trees