SNPs Problems, Complexity, and Algorithms

  title={SNPs Problems, Complexity, and Algorithms},
  author={Giuseppe Lancia and Vineet Bafna and Sorin Istrail and Ross Lippert and Russell Schwartz},
Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including medical diagnostic and drug design. They also provide the highest–resolution genomic fingerprint for tracking disease genes. This paper is devoted to algorithmic problems related to computational SNPs validation based on genome assembly of diploid organisms. In diploid genomes, there are two copies of each chromosome. A… CONTINUE READING
Highly Influential
This paper has highly influenced 16 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 234 citations. REVIEW CITATIONS


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

235 Citations

Citations per Year
Semantic Scholar estimates that this publication has 235 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 10 references


  • J. C. Venter, M. D. Adams
  • W. Myers et al., The Sequence of the Human Genome…
  • 2001
1 Excerpt

A polynomial algorithm for perfect graphs, Annals of Discr

  • M. Groetschel, L. Lovasz, A. Schrijver
  • Math. 21, 325–356,
  • 1984
1 Excerpt

On the complexity of the maximum subgraph problem

  • J. M. Lewis
  • Xth ACM Symposium on Theory of Computing,
  • 1978
1 Excerpt

Testing for consecutive ones property , interval graphs and planarity using PQ – tree algorithms

  • S. G. Lueker
  • J . Comput . Syst . Sci .
  • 1976

Similar Papers

Loading similar papers…