Finding the longest common subsequence for multiple biological sequences by ant colony optimization

Computers and Operations Research

Volumn 36, Issue 1, 2009, Pages 73-91

  Shyu, Shyong Jian ^a   Tsai, Chun Yuan ^b  

^a UNIVERSITY OF TAIPEI   (Taiwan)

^b MING CHUAN UNIVERSITY   (Taiwan)

Author keywords

Ant colony optimization; Approximation algorithm; Biological sequence; Longest common subsequence; Meta heuristics

Indexed keywords

AEROSPACE APPLICATIONS; ALGORITHMS; APPROXIMATION ALGORITHMS; APPROXIMATION THEORY; ARCHITECTURAL DESIGN; BIOINFORMATICS; BOOLEAN FUNCTIONS; COMPUTER NETWORKS; DATA COMPRESSION; DNA SEQUENCES; EVOLUTIONARY ALGORITHMS; FEATURE EXTRACTION; INTEGER PROGRAMMING; NUCLEAR PROPULSION; NUCLEIC ACIDS; OBJECT RECOGNITION; OPTIMIZATION; ORGANIC ACIDS; PATTERN RECOGNITION; PIGMENTS; SCHEDULING ALGORITHMS; TREES (MATHEMATICS);

(+ MOD 2N) OPERATION; ACO ALGORITHMS; ANT COLONY OPTIMIZATION (ACO); ANT COLONY OPTIMIZATION (ACO) ALGORITHMS; APPLIED MATHEMATICS; APPROXIMATE SOLUTIONS; BIOLOGICAL SEQUENCES; COMMON SUBSEQUENCE; COMPUTATIONAL BIOLOGY; ELSEVIER (CO); EXPERIMENTAL RESULTS; FAST ALGORITHMS; INTERNATIONAL (CO); LONGEST COMMON SUBSEQUENCE (LCSS); MULTIPLE SEQUENCES; NP HARD PROBLEMS; PROTEIN SEQUENCING; WIDE-RANGE;

SET THEORY;

EID: 44849139825     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2007.07.006     Document Type: Article

References (37)

1. Needleman S.B., and Wunsch C.D. A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology 48 (1970) 443-453
2. Wagner R.A., and Fischer M.J. The string-to-string correction problem. Journal of the ACM 21 1 (1974) 168-173
3. Smith T., and Waterman M. Identification of common molecular subsequences. Journal of Molecular Biology 147 (1981) 195-197
4. Sankoff D, Kruskal JB, editors, Time warps, string edits, and macromolecules: the theory and practice of sequence comparison. Reading, MA: Addison-Wesley; 1983.
5. Miller W., and Myers E.W. A file comparison program. Software-Practice & Experience 15 11 (1985) 1025-1040
6. Baeza-Yates R.A., and Gonnet G.H. A new approach to text searching. Communications of the ACM 35 (1992) 74-82
7. Gusfield D. Algorithms on strings, trees and sequences (1997), Cambridge University Press, New York
8. Jones J.C., and Pevzner P.A. An introduction to bioinformatics algorithms (2004), The MIT Press, Cambridge
9. Koller G, Raidl GR. An evolutionary algorithm for the maximum weight trace formulation of the multiple sequence alignment problem. Lecture notes in computer science, vol. 3242. Berlin: Springer; 2004. p. 302-11.
10. Shmygelka A, Aguirre-Hernandez R, Hoos H. An ant colony optimization algorithm for the 2D HP protein folding problem. Lecture notes in computer science, vol. 2463. Berlin: Springer; 2002. p. 40-52.
11. Hirschberg D.S. Algorithms for the longest common sequence problem. Journal of the ACM 24 4 (1977) 664-675
12. Masek W., and Peterson M. A faster algorithm computing string edit distances. Journal of Computer Systems and Science 20 1 (1980) 18-31
13. Apostolico A., and Guerra C. The longest common subsequence problem revisited. Algorithmica 18 1 (1987) 315-336
14. Breimer E.A., Goldberg M.K., and Lim D.T. A learning algorithm for the longest common subsequence problem. Journal of Experimental Algorithms 8 (2003) 1-12
15. Bergroth L, Hakonen H, Raita T. A survey of longest common subsequence algorithms. SPIRE'2000; 2000. p. 39-48.
16. Maier D. The complexity of some problems on subsequences and supersequences. Journal of the ACM 25 2 (1978) 322-336
17. Garey M.R., and Johnson D.S. Computers and intractability: a guide to the theory of NP-completeness (1979), W.H. Freeman and Company, New York
18. Hakata K, Imai H. The longest common subsequence problem for small alphabet size between many strings. Lecture notes in computer science, vol. 650. Berlin: Springer; 1992. p. 469-78.
19. Irving RW, Fraser CB. Two algorithms for the longest common subsequence of three (or more) strings. Lecture notes in computer science, vol. 644. Berlin: Springer; 1992. p. 214-29.
20. Jiang T., and Li M. On the approximation of shortest common supersequences and longest common subsequences. SIAM Journal on Computing 24 5 (1995) 1122-1139
21. Bonizzoni P., Vedova G.D., and Mauri G. Experimenting an approximation algorithm for the LCS. Discrete Applied Mathematics 110 (2001) 13-24
22. Huang KS, Yang CB, Tseng KT. Fast algorithms for finding the common subsequence of multiple sequences. In: Proceedings of international computer symposium; 2004. p. 90-95.
23. In: Voss S., Martello S., Osman I.H., and Roucairol C. (Eds). Meta-heuristics: theory and applications (1996), Kluwer Academic Publishers, Norwell, MA
24. In: Corne D., Dorigo M., and Glover F. (Eds). New ideas in optimization (1999), McGraw-Hill, New York
25. In: Ribeiro C.C., and Hansen P. (Eds). Essays and surveys in metaheuristics (2001), Kluwer Academic Publishers, Dordrecht
26. Dorigo M., Maniezzo V., and Colorni A. Positive feedback as a search strategy (1991), Dipartimento di Elettronica, Politecnico di Milano, Italy p. 91-116
27. Dorigo M. Optimization, learning and natural algorithms. PhD thesis, Politecnico di Milano, Italy; 1992.
28. Dorigo M., and Gambardella L.M. Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1 1 (1997) 53-66
29. Dorigo M., and Gambardella L.M. Ant colonies for the traveling salesman problem. BioSystems 43 (1997) 73-81
30. Dorigo M., and Caro G.D. Gambardella LM. Ant algorithm for discrete optimization. Artificial Life 5 (1999) 137-172
31. Maniezzo V., and Colorni A. The ant system applied to the quadratic assignment problem. IEEE Transactions on Knowledge and Data Engineering 11 5 (1999) 769-778
32. McMullen P.R. An ant colony optimization approach to addressing a JIT sequencing problem with multiple objectives. Artificial Intelligence in Engineering 15 3 (2001) 309-317
33. Merkle D., Middendorf M., and Schmeck H. Ant colony optimization for resource-constrained project scheduling. IEEE Transactions on Evolutionary Computing 6 4 (2002) 333-346
34. Shyu S.J., Yin P.Y., and Lin B.M.T. An ant colony optimization algorithm for the minimum weight vertex cover problem. Annals of Operations Research 131 (2004) 283-304
35. Shyu S.J., Lin B.M.T., and Hsiao T.S. Ant colony optimization for the cell assignment problem in PCS networks. Computers & Operations Research 33 6 (2006) 1713-1740
36. Page R.D.M., and Holmes E.C. Molecular evolution: a phylogenetic approach (1998), Blackwell Science, Oxford
37. Shyu SJ, Tsai CY. Empirical study on an ant colony optimization algorithm for the longest common subsequence problem. Technical Report 2007 [http://tmue.edu.tw/~sjshyu/public/aco_lcs/es_aco_lcs.pdf or http://www.csie.mcu.edu.tws/~sjshyu/resource/es_aco_lcs.pdf].