A Sublinear-Time Randomized Approximation Scheme for the Robinson-Foulds Metric

DOI10.1007/11732990_19MaRDI QIDQ3596272zbMATH OpenOpenAlexFDO

Authors Nicholas D. Pattengale, Bernard M. E. Moret

Publication date 30 August 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11732990_19

zbMATH Keywords

phylogenetic treesRobinson-Foulds metricsublinear-space embedding

Mathematics Subject Classification ID

Problems related to evolution (92D15)

Recommendations

• Faster computation of the Robinson-Foulds distance between phylogenetic networks
• Faster computation of the Robinson-Foulds distance between phylogenetic networks
• On a matching distance between rooted phylogenetic trees
• scientific article; zbMATH DE number 1833410
• A 3-approximation algorithm for the subtree distance between phylogenies

Cited in

(1)

• On a matching distance between rooted phylogenetic trees

Describes a project that uses

Uses Software

• Mesquite

This page was built for publication: A Sublinear-Time Randomized Approximation Scheme for the Robinson-Foulds Metric

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