论文信息 - Branch and bound algorithms to determine minimal evolutionary trees - 字舞流文

Branch and bound algorithms to determine minimal evolutionary trees

D. Penny | M. Hendy

[1] Techniques for the verification of minimal phylogenetic trees illustrated with ten mammalian haemoglobin sequences. , 1980, The Biochemical journal.

[2] R. W. Robinson,et al. Determining the asymptotic number of phylogenetic trees , 1980 .

[3] Walter M. Fitch,et al. On the Problem of Discovering the Most Parsimonious Tree , 1977, The American Naturalist.

[4] J. Hartigan. MINIMUM MUTATION FITS TO A GIVEN TREE , 1973 .

[5] G. Moore,et al. A method for constructing maximum parsimony ancestral amino acid sequences on a given network. , 1973, Journal of theoretical biology.

[6] W. Fitch. Toward Defining the Course of Evolution: Minimum Change for a Specific Tree Topology , 1971 .

[7] L. Cavalli-Sforza,et al. PHYLOGENETIC ANALYSIS: MODELS AND ESTIMATION PROCEDURES , 1967, Evolution; international journal of organic evolution.