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

PULLPRU: a practical approach to estimate phylogenies from single nucleotide polymorphism... Comp. Appl. Math. https://doi.org/10.1007/s40314-018-0638-y PULLPRU: a practical approach to estimate phylogenies from single nucleotide polymorphism haplotypes under the maximum parsimony criterion 1 1 2 R. Feizabadi · M. Bagherian · H. R. Vaziri · M. Salahi Received: 5 April 2017 / Revised: 29 April 2018 / Accepted: 2 May 2018 © SBMAC - Sociedade Brasileira de Matemática Aplicada e Computacional 2018 Abstract Phylogeny estimation has been the subject of several researches due to its sig- nificant importance and numerous applications. The aim of this research is to study the phylogeny estimation from Single Nucleotide Polymorphism (SNP) haplotypes under the maximum parsimony criterion (MPPEP-SNP). Previous exact methods have modeled the mentioned problem as a Mixed Integer Programming (MIP) problem. Since the problem, in general, proved to be NP-hard which causes MIP models to take long runtime for solving large-scale instances, the need for non-exact methods is obvious. In this paper, the authors propose a heuristic algorithm that attempts to find the MPPEP-SNP solution in several stages by solving a specific MIP model in each stage. Created based on network flows formulation, MIP models appearing in each stage are very small; therefore, their exact solutions could be found practically very fast. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Computational and Applied Mathematics Springer Journals

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

21 pages
Read Article

Loading next page...
 
/lp/springer_journal/pullpru-a-practical-approach-to-estimate-phylogenies-from-single-2f0Xu8FEbA
Publisher
Springer International Publishing
Copyright
Copyright © 2018 by SBMAC - Sociedade Brasileira de Matemática Aplicada e Computacional
Subject
Mathematics; Applications of Mathematics; Computational Mathematics and Numerical Analysis; Mathematical Applications in the Physical Sciences; Mathematical Applications in Computer Science
ISSN
0101-8205
eISSN
1807-0302
D.O.I.
10.1007/s40314-018-0638-y
Publisher site
See Article on Publisher Site

Abstract

Comp. Appl. Math. https://doi.org/10.1007/s40314-018-0638-y PULLPRU: a practical approach to estimate phylogenies from single nucleotide polymorphism haplotypes under the maximum parsimony criterion 1 1 2 R. Feizabadi · M. Bagherian · H. R. Vaziri · M. Salahi Received: 5 April 2017 / Revised: 29 April 2018 / Accepted: 2 May 2018 © SBMAC - Sociedade Brasileira de Matemática Aplicada e Computacional 2018 Abstract Phylogeny estimation has been the subject of several researches due to its sig- nificant importance and numerous applications. The aim of this research is to study the phylogeny estimation from Single Nucleotide Polymorphism (SNP) haplotypes under the maximum parsimony criterion (MPPEP-SNP). Previous exact methods have modeled the mentioned problem as a Mixed Integer Programming (MIP) problem. Since the problem, in general, proved to be NP-hard which causes MIP models to take long runtime for solving large-scale instances, the need for non-exact methods is obvious. In this paper, the authors propose a heuristic algorithm that attempts to find the MPPEP-SNP solution in several stages by solving a specific MIP model in each stage. Created based on network flows formulation, MIP models appearing in each stage are very small; therefore, their exact solutions could be found practically very fast.

Journal

Computational and Applied Mathematics – Springer Journals

Published: Jun 4, 2018

References

  • A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed
    Agarwala, R; Fernández-Baca, D
  • A linear-time algorithm for the perfect phylogeny haplotype problem
    Bonizzoni, P
  • Quantitative phylogenetic analysis in the 21st century
    Brooks, DR; Bilewitch, J; Condy, C; Evans, DC; Folinsbee, KE; Fröbisch, J
  • Mathematical approaches to polymer sequence analysis and related problems
    Bruni, R
  • A method for deducing branching sequences in phylogeny
    Camin, JH; Sokal, RR
  • The minimum evolution problem: overview and classification
    Catanzaro, D
  • A mixed integer linear programming model to reconstruct phylogenies from single nucleotide polymorphism haplotypes under the maximum parsimony criterion
    Catanzaro, D; Ravi, R; Schwartz, R
  • A linear-time algorithm for the perfect phylogeny haplotyping (PPH) problem
    Ding, Z; Filkov, V; Gusfield, D
  • Inferring phylogenies
    Felsenstein, J
  • The Steiner problem in phylogeny is NP-complete
    Foulds, LR; Graham, RL
  • A guide to the theory of NP-completeness
    Garey, MR; Johnson, DS
  • Mathematics of evolution and phylogeny
    Gascuel, O
  • How many genes should a systematist sample? Conflicting insights from a phylogenomic matrix characterized by replicated incongruence
    Gatesy, J; DeSalle, R; Wahlberg, N
  • Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time
    Graham, R; Foulds, L
  • Efficient algorithms for inferring evolutionary trees
    Gusfield, D
  • Combinatorial Pattern Matching. CPM 2003
    Gusfield, D
  • Taxon sampling and the accuracy of phylogenetic analyses
    Heath, TA; Hedtke, SM; Hillis, DM
  • Resolution of phylogenetic conflict in large data sets by increased taxon sampling
    Hedtke, SM; Townsend, TM; Hillis, DM
  • Reconstructing evolution of sequences subject to recombination using parsimony
    Hein, J
  • A heuristic method to reconstruct the history of sequences subject to recombination
    Hein, J
  • Is sparse taxon sampling a problem for phylogenetic inference?
    Hillis, DM; Pollock, DD; McGuire, JA; Zwickl, DJ
  • Efficient parsimony-based methods for phylogenetic network reconstruction
    Jin, G; Nakhleh, L; Snir, S; Tuller, T
  • A fast algorithm for the computation and enumeration of perfect phylogenies
    Kannan, S; Warnow, T
  • Generalized Buneman pruning for inferring the most parsimonious multi-state phylogeny
    Misra, N; Blelloch, G; Ravi, R; Schwartz, R
  • Increased taxon sampling is advantageous for phylogenetic inference
    Pollock, DD; Zwickl, DJ; McGuire, JA; Hillis, DM
  • Taxon sampling, bioinformatics, and phylogenomics
    Rosenberg, MS; Kumar, S
  • Phylogenetics
    Semple, C; Steel, MA
  • Analysis of human evolution
    Sforza, CL; Edwards, AWF
  • Bioinformatics Research and Applications. ISBRA 2007
    Sridhar, S; Lam, F; Blelloch, GE; Ravi, R; Schwartz, R
  • Mixed integer linear programming for maximum-parsimony phylogeny inference
    Sridhar, S; Lam, F; Blelloch, GE; Ravi, R; Schwartz, R
  • Increased taxon sampling greatly reduces phylogenetic error
    Zwickl, DJ; Hillis, DM

You’re reading a free preview. Subscribe to read the entire article.

Try 2 weeks free now

DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

or browse the journals available

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off

Sign up
for free
Start 14 day
Free Trial