PULLPRU: a practical approach to estimate phylogenies from single nucleotide polymorphism haplotypes under the maximum parsimony criterion

DOI10.1007/s40314-018-0638-yzbMath1413.90187OpenAlexW2805672756WikidataQ129733831 ScholiaQ129733831MaRDI QIDQ1715640

R. Feizabadi, H. R. Vaziri, Mehri Bagherian, Maziar Salahi

Publication date: 29 January 2019

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-018-0638-y

zbMATH Keywords

graphgreedy algorithmmixed integer programmingnetwork flowscomputational biologymaximum parsimonyhaplotypephylogeny estimation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Mixed integer programming (90C11)

Uses Software

• PHYLIP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reconstructing evolution of sequences subject to recombination using parsimony
• The Steiner problem in phylogeny is NP-complete
• Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time
• A linear-time algorithm for the perfect phylogeny haplotype problem
• A Polynomial-Time Algorithm For the Perfect Phylogeny Problem When the Number of Character States is Fixed
• A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies
• The minimum evolution problem: Overview and classification
• Efficient algorithms for inferring evolutionary trees

This page was built for publication: PULLPRU: a practical approach to estimate phylogenies from single nucleotide polymorphism haplotypes under the maximum parsimony criterion