Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem

@inproceedings{Rizzi2002PracticalAA,
  title={Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem},
  author={Romeo Rizzi and Vineet Bafna and Sorin Istrail and Giuseppe Lancia},
  booktitle={WABI},
  year={2002}
}
Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation, of foremost importance for a variety of applications including medical diagnostic, phylogenies and drug design. The complete SNPs sequence information from each of the two copies of a given chromosome in a diploid genome is called a haplotype. The Haplotyping Problem for a single individual is as follows: Given a set of fragments from one individual’s DNA, find a maximally consistent pair of SNPs… CONTINUE READING
Highly Cited
This paper has 106 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 58 extracted citations

106 Citations

01020'02'05'09'13'17
Citations per Year
Semantic Scholar estimates that this publication has 106 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…