A three-string approach to the closest string problem

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

Volumn 6196 LNCS, Issue , 2010, Pages 449-458

  Chen, Zhi Zhong ^a   Ma, Bin ^b   Wang, Lusheng ^c  

^a TOKYO DENKI UNIVERSITY   (Japan)

^b UNIVERSITY OF WATERLOO   (Canada)

^c CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY ALPHABET SIZE; BINARY STRING; CLOSEST STRING PROBLEM; DNA STRINGS; NEW APPROACHES; NP-HARD; PARAMETERIZED ALGORITHM; POLYNOMIAL TIME APPROXIMATION SCHEMES; TIME BOUND;

ALGORITHMS; HAMMING DISTANCE; POLYNOMIAL APPROXIMATION;

PROBLEM SOLVING;

EID: 77955020000     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14031-0_48     Document Type: Conference Paper

References (21)

1. Ben-Dor, A., Lancia, G., Perone, J., Ravi, R.: Banishing bias from consensus sequences. In: Hein, J., Apostolico, A. (eds.) CPM 1997. LNCS, vol.1264, pp. 247-261. Springer, Heidelberg (1997)
2. Chen, Z.Z., Wang, L.: Article 3A fast exact algorithm for the closest substring problem and its application to the planted (l, d)-motif model. In: TCBB (2009) (submitted for publication)
3. Deng, X., Li, G., Li, Z., Ma, B., Wang, L.: Genetic design of drugs without sideeffects. SIAM Journal on Computing 32(4), 1073-1090 (2003)
4. Dopazo, J., Rodrguez, A., S?aiz, J.C., Sobrino, F.: Design of primers for PCR amplification of highly variable genomes. CABIOS 9, 123-125 (1993)
5. Downey, R.G., Fellows, M.R.: Parameterized complexity. Monographs in Computer Science. Springer, New York (1999)
6. Evans, P.A., Smith, A.D.: Complexity of approximating closest substring problems. In: Lingas, A., Nilsson, B.J. (eds.) FCT 2003. LNCS, vol.2751, pp. 210-221. Springer, Heidelberg (2003)
7. Fellows, M.R., Gramm, J., Niedermeier, R.: On the parameterized intractability of motif search problems. Combinatorica 26(2), 141-167 (2006)
8. Frances, M., Litman, A.: On covering problems of codes. Theoretical Computer Science 30, 113-119 (1997) (Pubitemid 127339825)
9. Gramm, J., Guo, J., Niedermeier, R.: On exact and approximation algorithms for distinguishing substring selection. In: Lingas, A., Nilsson, B.J. (eds.) FCT 2003. LNCS, vol.2751, pp. 159-209. Springer, Heidelberg (2003)
10. Gramm, J., Niedermeier, R., Rossmanith, P.: Fixed-parameter algorithms for closest string and related problems. Algorithmica 37, 25-42 (2003)
11. Lanctot, K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string search problems. In: SODA 1999, pp. 633-642 (1999)
12. Li, M., Ma, B., Wang, L.: On the closest string and substring problems. Journal of the ACM 49(2), 157-171 (2002)
13. Ma, B., Sun, X.: More efficient algorithms for closest string and substring problems. In: RECOMB 2008, pp. 396-409 (2008)
14. Marx, D.: The closest substring problem with small distances. In: FOCS 2005, pp. 63-72 (2005)
15. Meneses, C.N., Lu, Z., Oliveira, C.A.S., Pardalos, P.M.: Optimal solutions for the closest-string problem via integer programming. INFORMS Journal on Computing (2004)
16. Nicolas, F., Rivals, E.: Complexities of the centre and median string problems. In: Proceedings of the 14th Annual Symposium on Combinatorial Pattern Matching, pp. 315-327 (2003)
17. Stojanovic, N., Berman, P., Gumucio, D., Hardison, R., Miller, W.: A linear-time algorithm for the 1-mismatch problem. In: Proceedings of the 5th International Workshop on Algorithms and Data Structures, pp. 126-135 (1997)
18. Wang, L., Dong, L.: Randomized algorithms for motif detection. Journal of Bioinformatics and Computational Biology 3(5), 1039-1052 (2005)
19. Wang, L., Zhu, B.: Efficient algorithms for the closest string and distinguishing string selection problems. In: The Third International Frontiers of Algorithmics Workshop, pp. 261-270 (2009)
20. Wang, Y., Chen, W., Li, X., Cheng, B.: Degenerated primer design to amplify the heavy chain variable region from immunoglobulin cDNA. BMC Bioinformatics 7(Suppl. 4), S9 (2006)
21. Zhao, R., Zhang, N.: A more efficient closest string algorithm. In: 2nd International Conference on Bioinformatics and Computational Biology (to appear, 2010)