Branch and bound algorithms to determine minimal evolutionary trees

Mathematical Biosciences

Volumn 59, Issue 2, 1982, Pages 277-290

  Hendy, M D ^a   Penny, David ^a  

^a MASSEY UNIVERSITY   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

PROTEIN;

ALGORITHM; METHODOLOGY; NONHUMAN;

EID: 0020286044     PISSN: 00255564     EISSN: None     Source Type: Journal    
DOI: 10.1016/0025-5564(82)90027-X     Document Type: Article

References (11)

1. Phylogenetic analysis models and estimation procedures
2. Toward defining the course of evolution minimum change for a specific tree topology
3. On the problem of discovering the most parsimonious tree
4. Evolutionary trees with minimum nucleotide replacements from amino and sequences
5. A graph theoretic approach to the development of minimal phylogenetic trees
6. A general approach to proving the minimality of phylogenetic trees illustrated by an example with a set of 23 vertebrates
7. Determining the asymptotic number of phylogenetic trees
8. Minimum mutation fits to a given tree
9. A method for constructing maximum parismony ancestral amino acid sequences on a given network
10. Techniques for the verification of minimal phylogenetic trees illustrated with ten mammalian haemoglobin sequences