Haplotyping with missing data via perfect path phylogenies
DOI10.1016/J.DAM.2005.09.020zbMATH Open1114.68080OpenAlexW2148556582MaRDI QIDQ876476FDOQ876476
Jens Gramm, Roded Sharan, Till Tantau, Till Nierhoff
Publication date: 18 April 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.09.020
Recommendations
- Parameterized and Exact Computation
- Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data
- Influence of tree topology restrictions on the complexity of haplotyping with missing data
- Fast perfect phylogeny haplotype inference.
- Phylogeny- and parsimony-based haplotype inference with constraints
missing dataincomplete dataphylogeneticshaplotypesfixed-parameter algorithmshaplotypinggenotypespath phylogeniesperfect phylogenies
Genetics and epigenetics (92D10) Problems related to evolution (92D15) Protein sequences, DNA sequences (92D20) Searching and sorting (68P10) Nonnumerical algorithms (68W05) Software, source code, etc. for problems pertaining to biology (92-04) Computational methods for problems pertaining to biology (92-08)
Cites Work
- Title not available (Why is that?)
- Recognition algorithms for orders of small width and graphs of small Dilworth number
- On the complexity of SNP block partitioning under the perfect phylogeny model
- Empirical Exploration of Perfect Phylogeny Haplotyping and Haplotypers
- Parameterized and Exact Computation
- Combinatorial Pattern Matching
Cited In (15)
- Computational Science – ICCS 2005
- Phylogeny- and parsimony-based haplotype inference with constraints
- Character-based phylogeny construction and its application to tumor evolution
- Influence of tree topology restrictions on the complexity of haplotyping with missing data
- Computational Science – ICCS 2005
- Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices
- On the complexity of SNP block partitioning under the perfect phylogeny model
- Integer Programming Formulations and Computations Solving Phylogenetic and Population Genetic Problems with Missing or Genotypic Data
- A linear-time parameterized algorithm for computing the width of a DAG
- 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
- Parameterized and Exact Computation
- Combinatorial Pattern Matching
- Empirical Exploration of Perfect Phylogeny Haplotyping and Haplotypers
This page was built for publication: Haplotyping with missing data via perfect path phylogenies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876476)
