Fast Algorithms for Inferring Evolutionary Trees
- 1 January 1995
- journal article
- research article
- Published by Mary Ann Liebert Inc in Journal of Computational Biology
- Vol. 2 (3) , 397-407
- https://doi.org/10.1089/cmb.1995.2.397
Abstract
We present algorithms for the perfect phylogeny problem restricted to binary characters. The first algorithm is faster than a previous algorithm by Gusfield when the input matrix for the problem is sparse. Next, we present two online algorithms. For the first of these, the set of species is fixed and the characters are given as input one at a time, while, for the second, the set of characters is fixed and the species are given as input one at a time. These two online algorithms are then combined into an algorithm that can process any sequence of additions and deletions of species and characters. Key words: phylogeny, character-based methods, online algorithmsKeywords
This publication has 4 references indexed in Scilit:
- Efficient algorithms for inferring evolutionary treesNetworks, 1991
- An idealized concept of the true cladistic characterMathematical Biosciences, 1975
- ASPECTS OF MOLECULAR EVOLUTIONAnnual Review of Genetics, 1973
- Cladistic Methodology: A Discussion of the Theoretical Basis for the Induction of Evolutionary HistoryAnnual Review of Ecology and Systematics, 1972