Dynamic programming algorithms for the mosaic longest common subsequence problem

Information Processing Letters

Volumn 102, Issue 2-3, 2007, Pages 99-103

  Huang, Kuo Si ^a   Yang, Chang Biau ^a   Tseng, Kuo Tsung ^a   Peng, Yung Hsing ^a   Ann, Hsing Yen ^a  

^a NATIONAL SUN YAT SEN UNIVERSITY   (Taiwan)

Author keywords

Bioinformatics; Design of algorithms; Dynamic programming; Longest common subsequence; Mosaic sequence

Indexed keywords

DYNAMIC PROGRAMMING; NUMERICAL METHODS; PROBLEM SOLVING;

BIOINFORMATICS; DESIGN OF ALGORITHMS; LONGEST COMMON SUBSEQUENCE; MOSAIC SEQUENCE;

ALGORITHMS;

EID: 33847275566     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.11.006     Document Type: Article

References (9)

1. Aggarwal A., Klawe M.M., Moran S., Shor P., and Wilber R. Geometric applications of a matrix-searching algorithm. Algorithmica 2 1 (1987) 195-208
2. Gusfield D. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology (1997), Cambridge University Press, New York
3. Hirschberg D.S. A linear space algorithm for computing maximal common subsequence. Communications of the ACM 18 6 (1975) 341-343
4. Komatsoulis G.A., and Waterman M.S. Chimeric alignment by dynamic programming: algorithm and biological uses. RECOMB '97: Proceedings of the First Annual International Conference on Computational Molecular Biology, New York, NY, USA (1997), ACM Press 174-180
5. Komatsoulis G.A., and Waterman M.S. A new computational method for detection of chimeric 16S rRNA artifacts generated by PCR amplification from mixed bacterial populations. Applied Environmental Microbiology 63 6 (June 1997) 2338-2346
6. Landau G.M., Schieber B., and Ziv-Ukelson M. Sparse LCS common substring alignment. Information Processing Letters 88 6 (2003) 259-270
7. Landau G.M., and Ziv-Ukelson M. On the common substring alignment problem. Journal of Algorithms 41 2 (2001) 338-354
8. Maier D. The complexity of some problems on subsequences and supersequences. Journal of the ACM 25 2 (1978) 322-336
9. Yang C.B., and Lee R.C.T. Systolic algorithms for the longest common subsequence problem. Journal of the Chinese Institute of Engineers 10 6 (1987) 691-699