Combinatorial Scoring of Phylogenetic Networks

DOI10.1007/978-3-319-42634-1_45zbMath1480.92140arXiv1602.02841OpenAlexW2258607074WikidataQ57056866 ScholiaQ57056866MaRDI QIDQ2817897

N. V. Alexeev, Max A. Alekseyev

Publication date: 2 September 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (2)

Counting General Phylogenetic networks ⋮ Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks

Cites Work

• Tree reconstruction from multi-state characters
• A note on convex characters, Fibonacci numbers and exponential-time algorithms
• Phylogenetic graph models beyond trees
• The complexity of reconstructing trees from qualitative characters and subtrees
• Combinatorial algorithms on a class of graphs

This page was built for publication: Combinatorial Scoring of Phylogenetic Networks