A more efficient algorithm for MPR problems in phylogeny

Discrete Applied Mathematics

Volumn 80, Issue 2-3, 1997, Pages 231-238

  Narushima, Hiroshi ^a   Hanazawa, Masazumi ^a  

^a TOKAI UNIVERSITY   (Japan)

Author keywords

Character state optimization; Evolutionary tree; Linear algorithm; Maximum parsimony; Most parsimonious reconstruction set

Indexed keywords

EID: 0242264231     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(97)00088-7     Document Type: Article

References (8)

1. M. Blum, R.W. Floyd, V. Pratt, R.L. Rivest, R.E. Tarjan, Time bounds for selection, J. Comput. System Sci. 7 (1973) 448-461.
2. J.M. Farris, Methods for computing Wagner trees, Systematic Zoology 19 (1970) 83-92.
3. M. Hanazawa, H. Narushima, N. Minaka, Generating most parsimonious reconstructions on a tree: a generalization of the Farris-Swofford-Maddison method, Discrete Applied Mathematics 56 (1995) 245-265.
4. M. Hanazawa, H. Narushima, A more efficient algorithm for MPR problems on an el-tree, in: Proc. 7th Franco-Japanese Days on Combinatorics, Optimization and Computational Geometry, 13-14, June 1994, Tokyo, Japan.
5. H. Narushima, Extremal properties of ACCTRAN reconstructions in phylogeny, preprint.
6. H. Narushima, N. Misheva, On the characteristics of the ancestral character-state reconstruction under the accelerated transformation optimization, preprint.
7. D.L. Swofford, W.P. Maddison, Reconstructing ancestral character states under Wagner parsimony, Mathematical Biosciences 87 (1987) 199-229.
8. D.L. Swofford, W.P. Maddison, Parsimony, character-state reconstructions, and evolutionary inferences, in: R.L. Mayden (Ed.), Systematics, Historical Ecology, and North American Freshwater Fishes, Stanford Univ. Press, California, 1992, pp. 186-223.