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

DOI10.1007/S10878-006-9025-5MaRDI QIDQ996826zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Algorithms and Computation
• An efficient algorithm for the rooted triplet distance between galled trees
• A cubic-time algorithm for computing the trinet distance between level-1 networks
• Computing the rooted triplet distance between phylogenetic networks
• Computing the rooted triplet distance between phylogenetic networks

Cites work

• scientific article; zbMATH DE number 1945177 (Why is no real title available?)
• Algorithms and Computation
• Algorithms for combining rooted triplets into a galled phylogenetic network
• Comparison of phylogenetic trees
• Computing and Combinatorics
• Computing the maximum agreement of phylogenetic networks
• Fast Algorithms for Finding Nearest Common Ancestors
• Non-shared edges and nearest neighbor interchanges revisited
• Reconstructing evolution of sequences subject to recombination using parsimony
• Research in Computational Molecular Biology
• Research in Computational Molecular Biology
• Research in Computational Molecular Biology
• Towards the development of computational tools for evaluating phylogenetic network reconstruction methods

Cited in

(11)

• Novel phylogenetic network distances based on cherry picking
• Fast and accurate branch support calculation for distance-based phylogenetic placements
• DISTANCE-BASED PHYLOGENETIC ALGORITHMS: NEW INSIGHTS AND APPLICATIONS
• Tripartitions do not always discriminate phylogenetic networks
• Faster computation of the Robinson-Foulds distance between phylogenetic networks
• Algorithms and Computation
• Computing the rooted triplet distance between galled trees by counting triangles
• Computing the rooted triplet distance between phylogenetic networks
• Computing the rooted triplet distance between phylogenetic networks
• Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks
• Faster computation of the Robinson-Foulds distance between phylogenetic networks

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

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