Path lengths in tree-child time consistent hybridization networks

DOI10.1016/j.ins.2009.09.013zbMath1180.92064arXiv0807.0087OpenAlexW2103656071MaRDI QIDQ845330

Francesc Rosselló, Mercè Llabrés, Gabriel Cardona, Gabriel Valiente

Publication date: 28 January 2010

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0807.0087

zbMATH Keywords

nodal distancehybridization networktree-child time consistent hybridization network

Mathematics Subject Classification ID

Problems related to evolution (92D15) Systems biology, networks (92C42)

Related Items (3)

Classes of explicit phylogenetic networks and their biological and mathematical significance ⋮ Deciding the existence of a cherry-picking sequence is hard on two trees ⋮ Trinets encode tree-child and level-2 phylogenetic networks

Uses Software

• PhyloNetwork

Cites Work

• Unnamed Item
• Unnamed Item
• Evolutionary design of oriented-tree networks using Cayley-type encodings
• Automatic learning of cost functions for graph edit distance
• Computing the maximum agreement of phylogenetic networks
• Reconstruction of certain phylogenetic networks from the genomes at their leaves
• Tripartitions do not always discriminate phylogenetic networks
• The Fine Structure of Galls in Phylogenetic Networks
• Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra
• A method for the linear recording of graphs

This page was built for publication: Path lengths in tree-child time consistent hybridization networks