Inferring evolutionary history from DNA sequences
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 362-371 vol.1
- https://doi.org/10.1109/fscs.1990.89555
Abstract
Two related problems are considered. The first is determining whether it is possible to triangulate a vertex-colored graph without introducing edges between vertices of the same color. This is related to a fundamental problem for geneticists, that of using character state information to construct evolutionary trees. The polynomial equivalence of these problems is demonstrated. An important subproblem arises when the characters are based on DNA sequences. Such characters assume up to four states. An O(n/sup 2/k) algorithm, where n is the number of species and k is the number of characters, is presented for this case.Keywords
This publication has 8 references indexed in Scilit:
- Efficient algorithms for inferring evolutionary treesNetworks, 1991
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- The computational complexity of inferring rooted phylogenies by parsimonyMathematical Biosciences, 1986
- Computational Complexity of Inferring Phylogenies by CompatibilitySystematic Zoology, 1986
- The steiner problem in phylogeny is NP-completeAdvances in Applied Mathematics, 1982
- A characterisation of rigid circuit graphsDiscrete Mathematics, 1974
- A Method for Deducing Branching Sequences in PhylogenyEvolution, 1965
- A Consistency Test for Phylogenies Based on Contemporaneous SpeciesSystematic Zoology, 1965