Faster computation of the Robinson-Foulds distance between phylogenetic networks

DOI10.1016/J.INS.2012.01.038MaRDI QIDQ454925zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

algorithmphylogenetic networkcluster representationFoulds distanceleaf-outerplanar phylogenetic networkminimum spreadRobinson

Mathematics Subject Classification ID

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)

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

Cites work

• A linear algorithm for embedding planar graphs using PQ-trees
• Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network
• Applied graph theory in computer vision and pattern recognition
• Combinatorial Pattern Matching Algorithms in Computational Biology Using Perl and R
• Comparison of phylogenetic trees
• Complexity of Finding Embeddings in a k-Tree
• Computing the maximum agreement of phylogenetic networks
• Fast algorithms for computing the tripartition-based distance between phylogenetic networks
• Fixed topology alignment with recombination
• Optimal algorithms for comparing trees with labeled leaves
• Planar graphs: Theory and algorithms
• The fine structure of galls in 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
• scientific article; zbMATH DE number 7205098 (Why is no real title available?)
• A Sublinear-Time Randomized Approximation Scheme for the Robinson-Foulds Metric

Describes a project that uses

Uses Software

• comput-biol
• PhyloNetwork
• QNet

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)