Faster computation of the Robinson-Foulds distance between phylogenetic networks

DOI10.1016/j.ins.2012.01.038zbMath1398.92165OpenAlexW1972644154MaRDI QIDQ454925

Kunihiko Sadakane, Jesper Jansson, Tetsuo Asano, 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

Analysis of algorithms and problem complexity (68Q25) Problems related to evolution (92D15) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Software, source code, etc. for problems pertaining to biology (92-04) Systems biology, networks (92C42)

Related Items (1)

Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks

Uses Software

• QNet
• PhyloNetwork
• comput-biol

Cites Work

• Applied graph theory in computer vision and pattern recognition
• Fast algorithms for computing the tripartition-based distance between phylogenetic networks
• Optimal algorithms for comparing trees with labeled leaves
• A linear algorithm for embedding planar graphs using PQ-trees
• Comparison of phylogenetic trees
• Planar graphs: Theory and algorithms
• Fixed topology alignment with recombination
• Computing the maximum agreement of phylogenetic networks
• The Fine Structure of Galls in Phylogenetic Networks
• Combinatorial Pattern Matching Algorithms in Computational Biology Using Perl and R
• Complexity of Finding Embeddings in a k-Tree
• Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network

This page was built for publication: Faster computation of the Robinson-Foulds distance between phylogenetic networks