More efficient algorithms for closest string and substring problems

SIAM Journal on Computing

Volumn 39, Issue 4, 2009, Pages 1432-1443

  Ma, Bin ^a   Sun, Xiaoming ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

Approximation algorithms; Closest string; Closest substring; Xed parameter algorithm

Indexed keywords

CLOSEST STRING; CLOSEST STRING PROBLEM; CLOSEST SUBSTRING; CLOSEST SUBSTRING PROBLEMS; COMPUTATIONAL BIOLOGY; EFFICIENT ALGORITHM; EXACT ALGORITHMS; INPUT STRING; NP COMPLETE; PARAMETERIZED COMPLEXITY; POLYNOMIAL TIME APPROXIMATION SCHEMES; POLYNOMIAL-TIME ALGORITHMS; SUBSTRING; THEORETICAL COMPUTER SCIENCE; TIME COMPLEXITY; XED-PARAMETER ALGORITHM;

BIOINFORMATICS; BIOLOGY; COMPUTATIONAL EFFICIENCY; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 70350159244     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/080739069     Document Type: Article

References (31)

1. A. Andoni, P. Indyk, and M. Patrascu, On the optimality of the dimensionality reduction method, in Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, 2006, pp. 449-458.
2. A. Ben-Dor, G. Lancia, J. Perone, and R. Ravi, Banishing bias from consensus sequences, in Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching, Lecture Notes In Computer Science, 1997, pp. 247-261.
3. J. Davila, S. Balla, and S. Rajasekaran, Space and time efficient algorithms for planted motif search, in International Conference on Computational Science, 2006, pp. 822-829.
4. X. Deng, G. Li, Z. Li, B. Ma, and L. Wang, Genetic design of drugs without side-e.ects, SIAM J. Comput., 32 (2003), pp. 1073-1090.
5. J. Dopazo, A. Rodríguez, J.C. Sáiz, and F. Sobrino, Design of primers for PCR ampli.- cation of highly variable genomes, CABIOS, 9 (1993), pp. 123-125.
6. R. G. Downey and M. R. Fellows, Parameterized complexity, Monographs in Computer Science, Springer-Verlag, New York, 1999.
7. P. A. Evans and A. D. Smith, Complexity of approximating closest substring problems, in FCT, 2003, pp. 210-221.
8. P. A. Evans, A. D. Smith, and H. T. Wareham, On the complexity of .nding common approximate substrings, Theoret. Comput. Sci., 306 (2003), pp. 407-430.
9. M.R. Fellows, J. Gramm, and R. Niedermeier, On the parameterized intractability of motif search problems, Combinatorica, 2 (2006), pp. 141-167.
10. M. Frances and A. Litman, On covering problems of codes, Theoret. Comput. Sci., 30 (1997), pp. 113-119. (Pubitemid 127339825)
11. J. Gramm, J. Guo, and R. Niedermeier, On exact and approximation algorithms for distinguishing substring selection, in FCT, (2003), pp. 159-209.
12. J. Gramm, F. Hüffner, and R. Niedermeier, Closest strings, primer design, and motif search, L. Florea et al eds., in Currents in Computational Molecular Biology, poster abstracts of RECOMB 2002, 2002, pp. 74-75.
13. J. Gramm, R. Niedermeier, and P. Rossmanith, Fixed-parameter algorithms for closest string and related problems, Algorithmica, 37 (2003), pp. 25-42.
14. Dorit S. Hochbaum, ed., Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, Boston, MA, 1996.
15. Y. Jiao, J. Xu, and M. Li, On the k-closest substring and k-consensus pattern problems, in Combinatorial Pattern Matching: 15th Annual Symposium (CPM 2004), Lecture Notes in Computer Science, 2004, pp. 130-144.
16. K. Lanctot, M. Li, B. Ma, S. Wang, and L. Zhang, Distinguishing string search problems, in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1999, pp. 633-642.
17. M. Li, B. Ma, and L. Wang, Finding similar regions in many strings, in Proceedings of the 31st ACM Symposium on Theory of Computing, 1999, pp. 473-482.
18. M. Li, B. Ma, and L. Wang, On the closest string and substring problems, J. ACM, 49 (2002), pp. 157-171.
19. X. Liu, H. He, and O. Sýkora, Parallel genetic algorithm and parallel simulated annealing algorithm for the closest string problem, in Advanced Data Mining and Applications, LNCS 3584, 2005, pp. 591-597.
20. K. Lucas, M. Busch, S. Mössinger, and J.A. Thompson, An improved microcomputer program for .nding gene- or gene family-speci.c oligonucleotides suitable as primers for polymerase chain reactions or as probes, CABIOS, 7 (1991), pp. 525-529.
21. B. Ma, A polynomial time approximation scheme for the closest substring problem, in Proceedings of the 11th Symposium on Combinatorial Pattern Matching, 2000, pp. 99-107.
22. D. Marx, The closest substring problem with small distances, in Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2005, pp. 63-72.
23. H. Mauch, M. J. Melzer, and J. S. Hu, Genetic algorithm approach for the closest string problem, in Proceedings of the 2nd IEEE Computer Society Bioinformatics Conference (CSB), 2003, pp. 560-561.
24. C. N. Meneses, Z. Lu, C. A. S. Oliveira, and P. M. Pardalos, Optimal solutions for the closest-string problem via integer programming, INFORMS J. Comput., 16 (2004), pp. 419-429.
25. C. Moan and I. Rusu, Hard problems in similarity searching, Discrete Appl. Math., 144 (2004), pp. 213-227.
26. F. Nicolas and E. Rivals, Complexities of the centre and median string problems, in Proceedings of the 14th Annual Symposium on Combinatorial Pattern Matching, 2003, pp. 315-327.
27. V. Proutski and E.C. Holme, Primer master: A new program for the design and analysis of PCR primers, CABIOS, 12 (1996), pp. 253-255.
28. P. Raghavan, Probabilistic construction of deterministic algorithms: Approximating packing integer program, J. Comp. System Sci., 37 (1988), 130-143.
29. N. Stojanovic, P. Berman, D. Gumucio, R. Hardison, and W. Miller, A linear-time algorithm for the 1-mismatch problem, in Proceedings of the 5th International Workshop on Algorithms and Data Structures, 1997, pp. 126-135.
30. L. Wang and L. Dong, Randomized algorithms for motif detection, J. Bioinfor. Comput. Bio., 3 (2005), pp. 1039-1052.
31. Y. Wang, W. Chen, X. Li, and B. Cheng, Degenerated primer design to amplify the heavy chain variable region from immunoglobulin cDNA, BMC Bio., 7 (2006), p. S9.