scientific article; zbMATH DE number 1302179

MaRDI QIDQ4247446zbMATH OpenFDO

Authors Xin He, Tao Jiang, John Tromp, Lusheng Wang, Louxin Zhang, Bhaskar Dasgupta, Ming Li

Publication date 17 April 2000

zbMATH Keywords

approximation algorithmnearest neighbour interchange distancephylogenytriangulation

Mathematics Subject Classification ID

Distance in graphs (05C12) Problems related to evolution (92D15)

Recommendations

• On the complexity of comparing evolutionary trees
• On computing the nearest neighbor interchange distance
• A robust model for finding optimal evolutionary tree

Cited in

(15)

• A computationally efficient approximation to the nearest neighbor interchange metric
• A robust model for finding optimal evolutionary tree
• Tripartitions do not always discriminate phylogenetic networks
• Computing an evolutionary ordering is hard
• An Evolutionary Distance Based on Maximal Unique Matches
• Efficiently Calculating Evolutionary Tree Measures Using SAT
• scientific article; zbMATH DE number 1541304 (Why is no real title available?)
• A rearrangement distance for fully-labelled trees
• Approximating the nearest neighbor intercharge distance for non-uniform-degree evolutionary trees
• scientific article; zbMATH DE number 6277703 (Why is no real title available?)
• Subtree transfer operations and their induced metrics on evolutionary trees
• On the complexity of comparing evolutionary trees
• Some notes on the nearest neighbour interchange distance
• The Bourque distances for mutation trees of cancers
• Statistics for phylogenetic trees

This page was built for publication:

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