Exact solutions for closest string and related problems

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

Volumn 2223 LNCS, Issue , 2001, Pages 441-453

  Gramm, Jens ^a   Niedermeier, Rolf ^a   Rossmanith, Peter ^b  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CLOSEST STRING; COMPUTATIONAL BIOLOGY; CORE PROBLEMS; EXACT SOLUTION; EXPONENTIAL GROWTH; FIXED-PARAMETER TRACTABILITY; LINEAR TIME; LINEAR-TIME ALGORITHMS; NP COMPLETE; POSITIVE INTEGER D;

BIOINFORMATICS; BIOLOGY; COMPUTATION THEORY; HAMMING DISTANCE; ALGORITHMS; CLUSTERING ALGORITHMS;

COMPUTATIONAL EFFICIENCY; HAMMING DISTANCE;

EID: 70350646559     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45678-3_38     Document Type: Conference Paper

References (12)

1. J. Alber, J. Gramm, and R. Niedermeier. Faster exact solutions for hard problems: a parameterized point of view. Discrete Mathematics, 229(1-3):3-27, 2001. 442, 443, 444
2. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer. 1999. 442, 443, 444
3. P. A. Evans and H. T. Wareham. Practical non-polynomial time algorithms for designing universal DNA oligonucleotides: a systematic approach. Manuscript, April 2001. 442, 443, 452
4. M. Frances and A. Litman. On covering problems of codes. Theory of Computing Systems, 30:113-119, 1997. 441
5. R. Kannan. Minkowski's convex body theorem and integer programming. Mathematics of Operations Research, 12:415-440, 1987. 447
6. J. K. Lanctot, M. Li, B. Ma, S. Wang, and L. Zhang. Distinguishing string selection problems. In Proc. of 10th ACM-SIAM SODA, pages 633-642, 1999, ACM Press. To appear in Information and Computation. 441
7. J. C. Lagarias. Point lattices. In R. L. Graham et al. (eds.) Handbook of Combinatorics, pages 919-966. MIT Press, 1995. 447
8. H. W. Lenstra. Integer programming with a fixed number of variables. Mathematics of Operations Research, 8:538-548, 1983. 447
9. M. Li, B. Ma, and L. Wang. Finding similar regions in many strings. In Proc. of 31st ACM STOC, pages 473-482, 1999. ACM Press. 442
10. P. A. Pevzner. Computational Molecular Biology: An Algorithmic Approach. MIT Press, 2000. 441
11. N. Stojanovic, P. Berman, D. Gumucio, R. Hardison, and W. Miller. A linear-time algorithm for the 1-mismatch problem. In Proc. of 5th WADS, number 1272 in LNCS, pages 126-135, 1997, Springer. 441, 442, 452
12. N. Stojanovic, L. Florea, C. Riemer, D. Gumucio, J. Slightom, M. Goodman, W. Miller, and R. Hardison. Comparison of five methods for finding conserved sequences in multiple alignments of gene regulatory regions. Nucleic Acids Research, 27(19):3899-3910, 1999. 441