A fast and accurate heuristic for the single individual snp haplotyping problem with many gaps, high reading error rate and low coverage

Authors:
Loredana M. Genovese;Filippo Geraci;Marco Pellegrini
Affiliations:
Istituto di Informatica e Telematica del CNR, Pisa, Italy;Istituto di Informatica e Telematica del CNR, Pisa, Italy;Istituto di Informatica e Telematica del CNR, Pisa, Italy
Venue:
WABI'07 Proceedings of the 7th international conference on Algorithms in Bioinformatics
Year:
2007

Citing 10
Cited 0

Haplotype reconstruction from SNP alignment

RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
A Dataset Generator for Whole Genome Shotgun Sequencing

Proceedings of the Seventh International Conference on Intelligent Systems for Molecular Biology
Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem

WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
SNPs Problems, Complexity, and Algorithms

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
The Haplotyping problem: an overview of computational models and solutions

Journal of Computer Science and Technology
Polynomial and APX-hard cases of the individual haplotyping problem

Theoretical Computer Science - Pattern discovery in the post genome
Haplotype reconstruction from SNP fragments by minimum error correction

Bioinformatics
The Complexity of the Single Individual SNP Haplotyping Problem

Algorithmica
Haplotype assembly from aligned weighted SNP fragments

Computational Biology and Chemistry
On the complexity of several haplotyping problems

WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Single nucleotide polymorphism (SNP) is the most frequent form of DNA variation. The set of SNPs present in a chromosome (called the haplotype) is of interest in a wide area of applications in molecular biology and biomedicine, including diagnostic and medical therapy. In this paper we propose a new heuristic method for the problem of haplotype reconstruction for (portions of ) a pair of homologous human chromosomes from a single individual (SIH). The problem is well known in literature and exact algorithms have been proposed for the case when no (or few) gaps are allowed in the input fragments. These algorithms, though exact and of polynomial complexity, are slow in practice. Therefore fast heuristics have been proposed. In this paper we describe a new heuristic method that is able to tackle the case of many gapped fragments and retains its effectiveness even when the input fragments have high rate of reading errors (up to 20%) and low coverage (as low as 3). We test our method on real data from the HapMap Project.