Fast algorithms for computing the tripartition-based distance between phylogenetic networks

DOI10.1007/s10878-006-9025-5zbMath1123.68139OpenAlexW2076195670MaRDI QIDQ996826

Wing-Kin Sung, C. Thach Nguyen, Nguyen Bao Nguyen

Publication date: 19 July 2007

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-006-9025-5

zbMATH Keywords

AlgorithmPhylogenetic networkTripartition-based distance

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Problems related to evolution (92D15) Nonnumerical algorithms (68W05)

Related Items (1)

Faster computation of the Robinson-Foulds distance between phylogenetic networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reconstructing evolution of sequences subject to recombination using parsimony
• Comparison of phylogenetic trees
• Computing the maximum agreement of phylogenetic networks
• Non-shared edges and nearest neighbor interchanges revisited
• Fast Algorithms for Finding Nearest Common Ancestors
• Computing and Combinatorics
• Research in Computational Molecular Biology
• Research in Computational Molecular Biology
• Research in Computational Molecular Biology
• Algorithms and Computation

This page was built for publication: Fast algorithms for computing the tripartition-based distance between phylogenetic networks