Optimal solutions for the closest-string problem via integer programming

INFORMS Journal on Computing

Volumn 16, Issue 4, 2004, Pages 419-429

  Meneses, Cláudio N ^a   Lu, Zhaosong ^b   Oliveira, Carlos A S ^a   Pardalos, Panos M ^a  

^a UNIVERSITY OF FLORIDA   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

Branch and bound algorithms; Closest string problem; Computational biology; Mathematical programming

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; MATHEMATICAL MODELS; MOLECULAR BIOLOGY; OPTIMAL SYSTEMS;

BRANCH-AND-BOUND ALGORITHMS; CLOSET-STRING PROBLEM; COMPUTATIONAL BIOLOGY; GENETIC DRUGS;

INTEGER PROGRAMMING;

EID: 10044284095     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1040.0090     Document Type: Article

References (18)

1. Ben-Dor, A., G. Lancia, J. Perone, R. Ravi. 1997. Banishing bias from consensus sequences. A. Apostolico, J. Hein, eds. Proc. Eighth Annual Sympos. Combin. Pattern Matching, Aarhus, Denmark, Lecture Notes in Computer Science, No. 1264. Springer-Verlag, Heidelberg, Germany, 247-261.
2. Downey, R. G., M. R. Fellows. 1999. Parameterized Complexity. Springer-Verlag, Heidelberg, Germany.
3. Frances, M., A. Litman. 1997. On covering problems of codes. Theoret. Comput. System 30 113-119.
4. Gasieniec, L., J. Jansson, A. Lingas. 1999. Efficient approximation algorithms for the Hamming center problem. Proc. Tenth ACM-SIAM Sympos. Discrete Algorithms, Baltimore, Maryland, Society for Industrial and Applied Mathematics, Philadelphia, PA, S905-S906.
5. Gramm, J., R. Niedermeier, P. Rossmanith. 2001. Exact solutions for closest string and related problems. Proc. Twelfth Annual Internat. Sympos. Algorithms Comput. (ISAAC 2001), Lecture Notes in Computer Science, No. 2223. Springer-Verlag, Heidelberg, Germany, 441-452.
6. Hertz, G., G. Stormo, 1995. Identification of consensus patterns in unaligned DNA and protein sequences: A large-deviation statistical basis for penalizing gaps. Lim, Cantor, eds. Proc. Third Internat. Conf. Bioinformatics Genome Res. World Scientific, Singapore, 201-216.
7. ILOG Inc. 2003. CPLEX 8.1 User's Manual. ILOG, Incline Village, NV, USA.
8. Lanctot, K., M. Li, B. Ma, S. Wang, L. Zhang. 2003. Distinguishing string selection problems. Inform. Comput. 185 41-55.
9. Lee, E., J. Mitchell. 2001. Integer programming: Branch and bound methods. C. Floudas, P. Pardalos, eds. Encyclopedia of Optimization, Vol. 2. Kluwer Academic Publishers, Dordrecht, Netherlands, 509-519.
10. Li, M., B. Ma, L. Wang. 1999. Finding similar regions in many strings. Proc. Thirty First Annual ACM Sympos. Theory Comput. ACM Press, Atlanta, GA, 473-482.
11. Li, M., B. Ma, L. Wang. 2002. On the closest string and substring problems. J. ACM 49 157-171.
12. McClure, M., T. Vasi, W. Fitch. 1994. Comparative analysis of multiple protein-sequence alignment methods. Mol. Biol. Evol. 11 571-592.
13. Park, S., K. Miller, 1988. Random number generators: Good ones are hard to find. Comm. ACM 31 1192-1201.
14. Rajasekaran, S., Y. Hu, J. Luo, H. Nick, P. Pardalos, S. Sahni, G. Shaw. 2001a. Efficient algorithms for similarity search. J. Combin. Optim. 5 125-132.
15. Rajasekaran, S., H. Nick, P. Pardalos, S. Sahni, G. Shaw. 2001b. Efficient algorithms for local alignment search. J. Combin. Optim. 5 117-124.
16. Roman, S. 1992. Coding and Information Theory. Graduate Texts in Mathematics, No. 134. Springer-Verlag, Heidelberg, Germany.
17. Stojanovic, N., P. Berman, D. Gumucio, R. Hardison, W. Miller. 1997. A linear-time algorithm for the 1-mismatch problem. Workshop on Algorithms and Data Structures, Halifax, Nova Scotia, Canada, Lecture Notes in Computer Science, No. 1272. Springer-Verlag, Heidelberg, Germany, 126-135.
18. Stormo, G., G. Hartzell III. 1991. Identifying protein-binding sites from unaligned DNA fragments. Proc. National Acad. Sci. USA 88 5699-5703.