Phylogeny- and parsimony-based haplotype inference with constraints

DOI10.1016/J.IC.2011.03.009MaRDI QIDQ418170zbMATH OpenOpenAlexFDO

Authors Michael Elberfeld, Till Tantau

Publication date 24 May 2012

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2011.03.009

zbMATH Keywords

fixed-parameter algorithmsmaximum parsimonypolynomial-time algorithmsperfect phylogeny

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Problems related to evolution (92D15)

Recommendations

• Phylogeny- and parsimony-based haplotype inference with constraints
• Fast perfect phylogeny haplotype inference.
• Haplotype Inference Constrained by Plausible Haplotype Data
• Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems
• Haplotyping with missing data via perfect path phylogenies

Cites work

• scientific article; zbMATH DE number 1161563 (Why is no real title available?)
• A linear-time algorithm for the perfect phylogeny haplotype problem
• Complete Parsimony Haplotype Inference Problem and Algorithms
• Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems
• Extended islands of tractability for parsimony haplotyping
• Haplotype Inference Constrained by Plausible Haplotype Data
• Haplotype Inferring Via Galled-Tree Networks Is NP-Complete
• Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices
• Haplotyping populations by pure parsimony: complexity of exact and approximation algorithms
• Haplotyping with missing data via perfect path phylogenies
• Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data
• The complexity of reconstructing trees from qualitative characters and subtrees

Cited in

(10)

• Computational Science – ICCS 2005
• Phylogeny- and parsimony-based haplotype inference with constraints
• Influence of tree topology restrictions on the complexity of haplotyping with missing data
• Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices
• Extended islands of tractability for parsimony haplotyping
• Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems
• Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data
• Haplotype Inference Constrained by Plausible Haplotype Data
• Fast perfect phylogeny haplotype inference.
• PULLPRU: a practical approach to estimate phylogenies from single nucleotide polymorphism haplotypes under the maximum parsimony criterion

This page was built for publication: Phylogeny- and parsimony-based haplotype inference with constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418170)