SNPs problems, complexity, and algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2161, Issue , 2001, Pages 182-193

  Lancia, Giuseppe ^a,b   Bafna, Vineet ^a   Istrail, Sorin ^a   Lippert, Ross ^a   Schwartz, Russell ^a  

^a CELERA GENOMICS   (United States)

^b UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DIAGNOSIS; DNA SEQUENCES; FLOW GRAPHS; GENE ENCODING; POLYNOMIAL APPROXIMATION;

ALGORITHMIC PROBLEMS; FRAGMENT ASSEMBLY; GENETIC VARIATION; MEDICAL DIAGNOSTICS; POLYNOMIAL ALGORITHM; POLYNOMIAL-TIME ALGORITHMS; SEQUENCE INFORMATIONS; SINGLE NUCLEOTIDE POLYMORPHISMS;

COMPUTATIONAL COMPLEXITY;

EID: 84943255398     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44676-1_15     Document Type: Conference Paper

References (8)

1. K. 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.
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.
3. M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic press, NY, 1980.
4. M. Groetschel, L. Lovasz and A. Schrijver. A polynomial algorithm for perfect graphs, Annals of Discr. Math. 21, 325-356, 1984.
5. R. B. Hayward. Weakly triangulated graphs, J. Comb. Th. (B) 39, 200-209, 1985.
6. J. M. Lewis, On the complexity of the maximum subgraph problem, Xth ACM Symposium on Theory of Computing, 265-274, 1978
7. J. C. Venter, M. D. Adams, E. W. Myers et al., The Sequence of the Human Genome, Science, 291, 1304-1351, 2001.
8. M. Yannakakis, Node-and Edge-deletion NP-complete Problems, Xth ACM Sym-posium on Theory of Computing, 253-264, 1978.