Polynomial and APX-hard cases of the individual haplotyping problem
- 1 May 2005
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 335 (1) , 109-125
- https://doi.org/10.1016/j.tcs.2004.12.017
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Haplotyping as Perfect Phylogeny: A Direct ApproachJournal of Computational Biology, 2003
- EFFICIENT RECONSTRUCTION OF HAPLOTYPE STRUCTURE VIA PERFECT PHYLOGENYJournal of Bioinformatics and Computational Biology, 2003
- Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping ProblemPublished by Springer Nature ,2002
- SNPs Problems, Complexity, and AlgorithmsPublished by Springer Nature ,2001
- Map of the Human Genome 3.0Science, 2001
- Inference of Haplotypes from Samples of Diploid Populations: Complexity and AlgorithmsJournal of Computational Biology, 2001
- The Sequence of the Human GenomeScience, 2001
- Initial sequencing and analysis of the human genomeNature, 2001
- It's raining SNPs, hallelujah?Nature Genetics, 1998
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976