Fast algorithms for computing the tripartition-based distance between phylogenetic networks
From MaRDI portal
Publication:996826
DOI10.1007/S10878-006-9025-5zbMATH Open1123.68139OpenAlexW2076195670MaRDI QIDQ996826FDOQ996826
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
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
Problems related to evolution (92D15) Analysis of algorithms (68W40) Nonnumerical algorithms (68W05)
Cites Work
- Comparison of phylogenetic trees
- Fast Algorithms for Finding Nearest Common Ancestors
- Reconstructing evolution of sequences subject to recombination using parsimony
- Research in Computational Molecular Biology
- Computing the maximum agreement of phylogenetic networks
- Title not available (Why is that?)
- Research in Computational Molecular Biology
- Algorithms and Computation
- Towards the development of computational tools for evaluating phylogenetic network reconstruction methods
- Research in Computational Molecular Biology
- Non-shared edges and nearest neighbor interchanges revisited
- Algorithms for combining rooted triplets into a galled phylogenetic network
- Computing and Combinatorics
Cited In (11)
- Faster computation of the Robinson-Foulds distance between phylogenetic networks
- Computing the rooted triplet distance between galled trees by counting triangles
- Faster computation of the Robinson-Foulds distance between phylogenetic networks
- Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks
- Computing the rooted triplet distance between phylogenetic networks
- Computing the rooted triplet distance between phylogenetic networks
- Fast and accurate branch support calculation for distance-based phylogenetic placements
- Tripartitions do not always discriminate phylogenetic networks
- Novel phylogenetic network distances based on cherry picking
- Algorithms and Computation
- DISTANCE-BASED PHYLOGENETIC ALGORITHMS: NEW INSIGHTS AND APPLICATIONS
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)
