Optimization techniques for string selection and comparison problems in genomics

IEEE Engineering in Medicine and Biology Magazine

Volumn 24, Issue 3, 2005, Pages 81-87

  Meneses, Cláudio N ^e   Oliveira, Carlos A S ^a   Pardalos, Panos M ^b,c,d  

^a OKLAHOMA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF FLORIDA   (United States)

^c Biomedical Engineering Program

^d Center for Applied Optimization   (United States)

^e University of Florida   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; AMINO ACID SEQUENCE; BACTERIAL INFECTION; GENE SEQUENCE; GENETIC PROCEDURES; GENETIC SELECTION; GENOMICS; MOLECULAR BIOLOGY; MOLECULAR EVOLUTION; MOLECULAR PROBE; PARAMETER; PHYLOGENY; POLYMERASE CHAIN REACTION; REVIEW;

ALGORITHMS; CLUSTER ANALYSIS; GENOMICS; NUMERICAL ANALYSIS, COMPUTER-ASSISTED; PATTERN RECOGNITION, AUTOMATED; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS; SOFTWARE;

EID: 20644444570     PISSN: 07395175     EISSN: None     Source Type: Journal    
DOI: 10.1109/MEMB.2005.1436464     Document Type: Review

References (22)

1. K. Lanctot, M. Li, B. Ma, S. Wang, and L. Zhang, "Distinguishing string selection problems," Inf. Comput., vol. 185, no. 1, pp. 41-55, 2003.
2. J. Dopazo, A. Rodriguez, J.C. Saiz, and F. Sobrino, "Design of primers for PCR amplification of highly variable genomes," Comput. Appl. Biosci., vol. 9, no. 2, pp. 123-125, 1993.
3. K. Lucas, M. Busch, S. Mössinger, and J.A. Thompson, "An improved microcomputer program for finding gene- or gene family-specific oligonucleotides suitable as primers for polymerase chain reactions or as probes," Comput. Appl. Biosci., vol. 7, no. 4, pp. 525-529, 1991.
4. G. Hertz and G. Stormo, "Identification of consensus patterns in unaligned DNA and protein sequences: A large-deviation statistical basis for penalizing gaps," in Proc. 3rd Int. Conf. Bioinformatics Genome Research, Tallahassee, FL, 1995, pp. 201-216.
5. C. Lawrence and A. Reilly, "An expectation maximization (EM) algorithm for the identification and characterization of common sites in unaligned biopolymer sequences," Proteins, vol. 7, no. 1, pp. 41-51, 1990.
6. G.D. Stormo, "Consensus patterns in DNA," Methods Enzymol., vol. 183, pp. 211-221, 1990.
7. G.D. Stormo and G.W. Hartzell III, "Identifying protein-binding sites from unaligned DNA fragments," Proc. Nat. Acad. Sci., vol. 86, no. 4, pp. 1183-1187, 1989.
8. G.N. Lance and W.T. Williams, "A general theory of classificatory sorting strategies: 1. hierarchical systems," Computer J., vol. 9, no. 4, pp. 373-380, 1967.
9. 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., vol. 16, no. 4, pp. 419-429, 2004.
10. X. Huang, "Bio-sequence comparison and applications," in Current Topics in Computational Biology, T. Jiang, Y. Xu, and M. Zhang, Eds. Cambridge, MA: MIT Press, 2002, pp. 45-69.
11. S. Roman, Coding and Information Theory, vol. 134. Graduate Texts in Mathematics series. New York: Springer-Verlag, 1992.
12. M. Frances and A. Litman, "On covering problems of codes," Theor. Comput. Syst., vol. 30, no. 2, pp. 113-119, 1997.
13. D. Hochbaum, editor, Approximation Algorithms for NP-hard Problems. Boston, MA: PWS, 1996.
14. V. Vazirani, Approximation Algorithms. New York: Springer-Verlag, 2001.
15. M. Li, B. Ma, and L. Wang, "Finding similar regions in many strings," in Proc. 31st Annu. ACM Symp. Theory Comput., Atlanta, 1999, pp. 473-482.
16. L. Gasieniec, J. Jansson, and A. Lingas, "Efficient approximation algorithms for the hamming center problem," in Proc. 10th ACM-SIAM Symp. Discrete Algorithms, 1999, pp. S905-S906.
17. R.G. Downey and M.R. Fellows, Parameterized Complexity. New York: Springer-Verlag, 1999.
18. M.R. Fellows, "Parameterized complexity: The main ideas and connections to practical computing," in Experimental Algorithmes, vol. 2547, Lecture Notes of Computer Science series. New York: Springer-Verlag, 2002, pp. 51-77.
19. J. Gramm, R. Niedermeier, and P. Rossmanith, "Exact solutions for closest string and related problems," in Proc. 12th Annu. Int. Symp. Algorithms Computation, vol. 2223, Lecture Notes in Computer Science series. New York: Springer Verlag, 2001, pp. 441-452.
20. J. Gramm, R. Niedermeier, and P. Rossmanith, "Fixed-parameter algorithms for closest string and related problems," Algorithmica, vol. 37, no. 1, pp. 25-42, 2003.
21. A. Ben-Dor, G. Lancia, J. Perone, and R. Ravi, "Banishing bias from consensus sequences," in Proc. 8th Annu. Symp. on Combinatorial Pattern Matching, vol. 1264 of Lecture Notes in Computer Science, A. Apostolico and J. Hein, Eds. New York: Springer-Verlag, 1997, pp. 247-261.
22. M.R. Fellows, J. Gramm, and R. Niedermeier, "On the parameterized intractability of closest substring and related problems," in Proc. 19th Int. Symp. Theoretical Aspects Comput. Sci., vol. 2285, Lecture Notes in Computer Science. H. Alt and A. Ferreira, Eds. New York: Springer-Verlag, 2002, pp. 262-273.