Advertisement

SNPs Problems, Complexity, and Algorithms

  • Giuseppe Lancia
  • Vineet Bafna
  • Sorin Istrail
  • Ross Lippert
  • Russell Schwartz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2161)

Abstract

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.

Keywords

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.zbMATHMathSciNetGoogle Scholar
  2. 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.zbMATHGoogle Scholar
  3. 3.
    M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic press, NY, 1980.zbMATHGoogle Scholar
  4. 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. 5.
    R. B. Hayward. Weakly triangulated graphs, J. Comb. Th. (B) 39, 200–209, 1985.zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    J. M. Lewis, On the complexity of the maximum subgraph problem, Xth ACM Symposium on Theory of Computing, 265–274, 1978Google Scholar
  7. 7.
    J. C. Venter, M. D. Adams, E. W. Myers et al., The Sequence of the Human Genome, Science, 291, 1304–1351, 2001.CrossRefGoogle Scholar
  8. 8.
    M. Yannakakis, Node-and Edge-deletion NP-complete Problems, Xth ACM Symposium on Theory of Computing, 253–264, 1978.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Giuseppe Lancia
    • 1
    • 2
  • Vineet Bafna
    • 1
  • Sorin Istrail
    • 1
  • Ross Lippert
    • 1
  • Russell Schwartz
    • 1
  1. 1.Celera GenomicsRockvilleUSA
  2. 2.D.E.I., Università di PadovaPadovaItaly

Personalised recommendations