Faster computation of the Robinson-Foulds distance between phylogenetic networks
DOI10.1016/J.INS.2012.01.038zbMATH Open1398.92165OpenAlexW1972644154MaRDI QIDQ454925FDOQ454925
Authors: Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, Gabriel Valiente 
Publication date: 2 October 2012
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2012.01.038
Recommendations
- Faster computation of the Robinson-Foulds distance between phylogenetic networks
- Fast algorithms for computing the tripartition-based distance between phylogenetic networks
- Algorithms and Computation
- Computing the rooted triplet distance between phylogenetic networks
- Computing the rooted triplet distance between phylogenetic networks
algorithmphylogenetic networkcluster representationFoulds distanceleaf-outerplanar phylogenetic networkminimum spreadRobinson
Problems related to evolution (92D15) Analysis of algorithms and problem complexity (68Q25) Systems biology, networks (92C42) Software, source code, etc. for problems pertaining to biology (92-04) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)
Cites Work
- Combinatorial Pattern Matching Algorithms in Computational Biology Using Perl and R
- Comparison of phylogenetic trees
- A linear algorithm for embedding planar graphs using PQ-trees
- The fine structure of galls in phylogenetic networks
- Complexity of Finding Embeddings in a k-Tree
- Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network
- Optimal algorithms for comparing trees with labeled leaves
- Computing the maximum agreement of phylogenetic networks
- Fixed topology alignment with recombination
- Planar graphs: Theory and algorithms
- Applied graph theory in computer vision and pattern recognition
- Fast algorithms for computing the tripartition-based distance between phylogenetic networks
Cited In (8)
- Faster computation of the Robinson-Foulds distance between phylogenetic networks
- Towards Distributivity in FCA for Phylogenetic Data
- Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks
- Computing the rooted triplet distance between phylogenetic networks
- Fast and accurate branch support calculation for distance-based phylogenetic placements
- Faster exact computation of rSPR distance
- Title not available (Why is that?)
- A Sublinear-Time Randomized Approximation Scheme for the Robinson-Foulds Metric
Uses Software
This page was built for publication: Faster computation of the Robinson-Foulds distance between phylogenetic networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q454925)
