Skip to main content

SNPs Problems, Complexity, and Algorithms

Part of the Lecture Notes in Computer Science book series (LNCS,volume 2161)


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 description of the SNPs sequence information from one of the two chromosomes is called SNPs haplotype. The basic problem addressed here is the Haplotyping, i.e., given a set of SNPs prospects inferred from the assembly alignment of a genomic region of a chromosome, find the maximally consistent pair of SNPs haplotypes by removing data “errors” related to DNA sequencing errors, repeats, and paralogous recruitment. In this paper, we introduce several versions of the problem from a computational point of view. We show that the general SNPs Haplotyping Problem is NP-hard for mate-pairs assembly data, and design polynomial time algorithms for fragment assembly data. We give a network-flow based polynomial algorithm for the Minimum Fragment Removal Problem, and we show that the Minimum SNPs Removal problem amounts to finding the largest independent set in a weakly triangulated graph.


  • Polynomial Time
  • Bipartite Graph
  • Mate Pair
  • Perfect Graph
  • Chordless Cycle

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/3-540-44676-1_15
  • Chapter length: 12 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
USD   99.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-44676-7
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   129.00
Price excludes VAT (USA)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. S. Booth and S. G. Lueker. Testing for consecutive ones property, interval graphs and planarity using PQ-tree algorithms, J. Comput. Syst. Sci. 13, 335–379, 1976.

    MATH  MathSciNet  Google Scholar 

  2. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. W. Freeman and Co, SF, 1979.

    MATH  Google Scholar 

  3. M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic press, NY, 1980.

    MATH  Google Scholar 

  4. M. Groetschel, L. Lovasz and A. Schrijver. A polynomial algorithm for perfect graphs, Annals of Discr. Math. 21, 325–356, 1984.

    Google Scholar 

  5. R. B. Hayward. Weakly triangulated graphs, J. Comb. Th. (B) 39, 200–209, 1985.

    CrossRef  MATH  MathSciNet  Google Scholar 

  6. J. M. Lewis, On the complexity of the maximum subgraph problem, Xth ACM Symposium on Theory of Computing, 265–274, 1978

    Google Scholar 

  7. J. C. Venter, M. D. Adams, E. W. Myers et al., The Sequence of the Human Genome, Science, 291, 1304–1351, 2001.

    CrossRef  Google Scholar 

  8. M. Yannakakis, Node-and Edge-deletion NP-complete Problems, Xth ACM Symposium on Theory of Computing, 253–264, 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations


Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lancia, G., Bafna, V., Istrail, S., Lippert, R., Schwartz, R. (2001). SNPs Problems, Complexity, and Algorithms. In: auf der Heide, F.M. (eds) Algorithms — ESA 2001. ESA 2001. Lecture Notes in Computer Science, vol 2161. Springer, Berlin, Heidelberg.

Download citation

  • DOI:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42493-2

  • Online ISBN: 978-3-540-44676-7

  • eBook Packages: Springer Book Archive