Tripartitions do not always discriminate phylogenetic networks

DOI10.1016/j.mbs.2007.11.003zbMath1130.92040arXiv0707.2376OpenAlexW2964340057WikidataQ51897297 ScholiaQ51897297MaRDI QIDQ2476109

Gabriel Valiente, Gabriel Cardona, Francesc Rosselló

Publication date: 11 March 2008

Published in: Mathematical Biosciences (Search for Journal in Brave)

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

zbMATH Keywords

recombinationbipartitionsdirected acyclic graphserror metrictripartition metrictripartitions

Mathematics Subject Classification ID

Problems related to evolution (92D15) Applications of graph theory (05C90)

Related Items (4)

Encoding and constructing 1-nested phylogenetic networks with trinets ⋮ Path lengths in tree-child time consistent hybridization networks ⋮ Properties of normal phylogenetic networks ⋮ Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks

Cites Work

• Comparison of phylogenetic trees
• The Fine Structure of Galls in Phylogenetic Networks
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Tripartitions do not always discriminate phylogenetic networks