Beam search for the longest common subsequence problem

Computers and Operations Research

Volumn 36, Issue 12, 2009, Pages 3178-3186

  Blum, Christian ^a   Blesa, Maria J ^a   López Ibáñez, Manuel ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b EDINBURGH NAPIER UNIVERSITY   (United Kingdom)

Author keywords

Beam search; Longest common subsequence problem

Indexed keywords

BEAM SEARCH; BEAM SEARCH ALGORITHMS; COMPUTATION TIME; COMPUTATIONAL BIOLOGY; HEURISTIC APPROACH; LONGEST COMMON SUBSEQUENCE PROBLEM; RESEARCH EFFORTS; SOLUTION QUALITY; STATE-OF-THE-ART APPROACH;

BIOINFORMATICS; LEARNING ALGORITHMS; OBJECT RECOGNITION;

PROBLEM SOLVING;

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

References (32)

1. Aho A., Hopcroft J., and Ullman J. Data structures and algorithms (1983), Addison-Wesley, Reading, MA
2. Bergroth L., Hakonen H., and Raita T. New approximation algorithms for longest common subsequences. Proceedings of string processing and information retrieval: a South American symposium (1998) 32-40
3. Bergroth L., Hakonen H., and Raita T. A survey of longest common subsequence algorithms. Proceedings of SPIRE 2000-7th international symposium on string processing and information retrieval (2000), IEEE Press 39-48
4. Blum C., and Blesa M. Probabilistic beam search for the longest common subsequence problem. In: Stützle T., Birattari M., and Hoos H.H. (Eds). Proceedings of SLS 2007-engineering stochastic local search algorithms. Lecture notes in computer science vol. 4638 (2007), Springer, Berlin, Germany 150-161
5. Blum C, Blesa MJ, López-Ibáñez M. Beam search for the longest common subsequence problem. Technical Report LSI-08-29, Department LSI, Univeristat Politècnica de Catalunya, 2008.
6. Bonizzoni P., Della Vedova G., and Mauri G. Experimenting an approximation algorithm for the LCS. Discrete Applied Mathematics 110 1 (2001) 13-24
7. Brisk P., Kaplan A., and Sarrafzadeh M. Area-efficient instruction set synthesis for reconfigurable system-on-chip design. Proceedings of the 41st design automation conference (2004), IEEE Press 395-400
8. Chin F., and Poon C.K. Performance analysis of some simple heuristics for computing longest common subsequences. Algorithmica 12 4-5 (1994) 293-311
9. Dorigo M., and Stützle T. Ant colony optimization (2004), MIT Press, Cambridge, MA
10. Easton T, Singireddy A. A large neighborhood search heuristic for the longest common subsequence problem. Journal of Heuristics 2008;14(3):271-83.
11. Easton T., and Singireddy A. A specialized branching and fathoming technique for the longest common subsequence problem. International Journal of Operations Research 4 2 (2007) 98-104
12. Fraser CB. Subsequences and supersequences of strings. PhD thesis, University of Glasgow; 1995.
13. Ghirardi M., and Potts C.N. Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach. European Journal of Operational Research 165 2 (2005) 457-467
14. Guenoche A. Supersequence of masks for oligo-chips. Journal of Bioinformatics and Computational Biology 2 3 (2004) 459-469
15. Guenoche A., and Vitte P. Longest common subsequence with many strings: exact and approximate methods. Technique et Science Informatiques 14 7 (1995) 897-915 [in French]
16. Gusfield D. Algorithms on strings, trees, and sequences. Computer science and computational biology. Cambridge: Cambridge University Press; 1997.
17. Hsu W.J., and Du M.W. Computing a longest common subsequence for a set of strings. BIT Numerical Mathematics 24 1 (1984) 45-59
18. Huang K., Yang C., and Tseng K. Fast algorithms for finding the common subsequences of multiple sequences. Proceedings of the international computer symposium (2004), IEEE Press 1006-1011
19. Jiang T., Lin G., Ma B., and Zhang K. A general edit distance between RNA structures. Journal of Computational Biology 9 2 (2002) 371-388
20. Tao J., and Li M. On the approximation of shortest common supersequences and longest common subsequences. SIAM Journal on Computing 24 5 (1995) 1122-1139
21. Lee G.-C., and Woodruff D.L. Beam search for peak alignment of NMR signals. Analytica Chimica Acta 513 2 (2004) 413-416
22. Lu S.Y., and Fu K.S. A sentence-to-sentence clustering procedure for pattern analysis. IEEE Transactions on Systems, Man and Cybernetics 8 5 (1978) 381-389
23. Maier D. The complexity of some problems on subsequences and supersequences. Journal of the ACM 25 (1978) 322-336
24. Ow P.S., and Morton T.E. Filtered beam search in scheduling. International Journal of Production Research 26 (1988) 297-307
25. Sabuncuoglu I., and Bayiz M. Job shop scheduling with beam search. European Journal of Operational Research 118 2 (1999) 390-412
26. Sankoff D., and Kruskal J.B. Time warps, string edits, and macromolecules: the theory and practice of sequence comparison (1983), Addison-Wesley, Reading, UK
27. Sellis T. Multiple query optimization. ACM Transactions on Database Systems 13 1 (1988) 23-52
28. Shyu SJ, Tsai C-Y. Finding the longest common subsequence for multiple biological sequences by ant colony optimization. Computers & Operations Research 2009;36(1):73-91.
29. Singireddy A. Solving the longest common subsequence problem in bioinformatics. Master's thesis, Industrial and Manufacturing Systems Engineering, Kansas State University, Manhattan, KS; 2007.
30. Smith T., and Waterman M. Identification of common molecular subsequences. Journal of Molecular Biology 147 1 (1981) 195-197
31. Storer J. Data compression: methods and theory (1988), Computer Science Press, Maryland
32. Valente J.M.S., and Alves R.A.F.S. Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time. Computers & Industrial Engineering 48 2 (2005) 363-375