Algorithms and Computation
From MaRDI portal
Publication:5897873
DOI10.1007/11602613zbMATH Open1173.92314OpenAlexW2304246803MaRDI QIDQ5897873FDOQ5897873
Authors: Nguyen Bao Nguyen, C. Thach Nguyen, Wing-Kin Sung 
Publication date: 14 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11602613
Recommendations
- Fast algorithms for computing the tripartition-based distance between phylogenetic networks
- 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) Computational methods for problems pertaining to biology (92-08)
Cited In (9)
- Faster computation of the Robinson-Foulds distance between phylogenetic networks
- 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
- Fast algorithms for computing the tripartition-based 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
- DISTANCE-BASED PHYLOGENETIC ALGORITHMS: NEW INSIGHTS AND APPLICATIONS
This page was built for publication: Algorithms and Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897873)
