scientific article; zbMATH DE number 2080274

MaRDI QIDQ4472525zbMATH OpenFDO

Authors Wing-Kai Hon, Ming-Yang Kao, Tak-Wah Lam

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1969/19690527.htm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problems related to evolution (92D15)

Recommendations

• Non-shared edges and nearest neighbor interchanges revisited
• SUBTREE TRANSFER DISTANCE FOR DEGREE-D PHYLOGENIES
• On the linear-cost subtree-transfer distance between phylogenetic trees
• A computationally efficient approximation to the nearest neighbor interchange metric
• On computing the nearest neighbor interchange distance

Cited in

(4)

• On the linear-cost subtree-transfer distance between phylogenetic trees
• SUBTREE TRANSFER DISTANCE FOR DEGREE-D PHYLOGENIES
• Rapidly computing the phylogenetic transfer index
• Efficiently inferring pairwise subtree prune-and-regraft adjacencies between 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 Q4472525)