Edge lengths of trees from sequence data

DOI10.1016/0025-5564(87)90108-8MaRDI QIDQ1101042zbMATH OpenOpenAlexFDO

Authors David Penny, M. D. Hendy

Publication date 1987

Published in Mathematical Biosciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0025-5564(87)90108-8

zbMATH Keywords

phylogenetic treeevolutionary treesFitch's algorithmindication of relative time intervalsmaximum parsimony modelmeasure of edge lengthsequence data

Mathematics Subject Classification ID

Trees (05C05) Other natural sciences (mathematical treatment) (92F05)

Recommendations

• Significance of the length of the shortest tree
• Do tree split probabilities determine the branch lengths?
• Phylogenies without branch bounds: contracting the short, pruning the deep
• Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges
• Minimizing phylogenetic number to find good evolutionary trees

Cites work

• Branch and bound algorithms to determine minimal evolutionary trees
• Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time

Cited in

(4)

• Analyzing and visualizing sequence and distance data using SPLITSTREE
• Do tree split probabilities determine the branch lengths?
• Conditions under which distributions of edge length ratios on phylogenetic trees can be used to order evolutionary events
• Significance of the length of the shortest tree

This page was built for publication: Edge lengths of trees from sequence data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1101042)