Finding a most parsimonious or likely tree in a network with respect to an alignment

DOI10.1007/s00285-018-1282-2zbMath1410.92075arXiv1707.03648OpenAlexW2964309341WikidataQ56888837 ScholiaQ56888837MaRDI QIDQ1738036

Celine Scornavacca, Fabio Pardi, Leo van Iersel, Steven Kelk

Publication date: 29 March 2019

Published in: Journal of Mathematical Biology (Search for Journal in Brave)

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

zbMATH Keywords

maximum likelihoodNP-hardnessphylogenetic treemaximum parsimonyphylogenetic networkAPX-hardness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problems related to evolution (92D15)

Uses Software

• tcp_package

Cites Work

• Unnamed Item
• Unnamed Item
• Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable
• Reconstructing evolution of sequences subject to recombination using parsimony
• Seeing the trees and their branches in the network is hard
• Optimization, approximation, and complexity classes
• Taxonomy with confidence
• Links between maximum likelihood and maximum parsimony under a simple model of site substitution
• Locating a tree in a phylogenetic network
• Locating a Tree in a Phylogenetic Network in Quadratic Time
• On Computing the Maximum Parsimony Score of a Phylogenetic Network

This page was built for publication: Finding a most parsimonious or likely tree in a network with respect to an alignment