Efficient algorithms for finding interleaving relationship between sequences

Information Processing Letters

Volumn 105, Issue 5, 2008, Pages 188-193

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

^a NATIONAL SUN YAT SEN UNIVERSITY   (Taiwan)

Author keywords

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

Indexed keywords

BIOINFORMATICS; DYNAMIC PROGRAMMING; GENES; PROBLEM SOLVING;

DESIGN OF ALGORITHMS; LONGEST COMMON SUBSEQUENCE; MERGED SEQUENCE; TIME COMPLEXITY;

ALGORITHMS;

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

References (20)

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. Baker B.S., and Giancarlo R. Sparse dynamic programming for longest common subsequence from fragments. Journal of Algorithms 42 2 (2002) 231-254
3. Benson D.A., Karsch-Mizrachi I., Lipman D.J., Ostell J., and Wheeler D.L. GenBank. Nucleic Acids Research 34 (2006) D16-D20
4. Chin F.Y.L., Santis A.D., Ferrara A.L., Ho N.L., and Kim S.K. A simple algorithm for the constrained sequence problems. Information Processing Letters 90 4 (2004) 175-179
5. Gusfield D. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology (1997), Cambridge Press, New York
6. Hirschberg D.S. A linear space algorithm for computing maximal common subsequence. Communications of the ACM 18 6 (1975) 341-343
7. Hokamp K., McLysaght A., and Wolfe K.H. The 2R hypothesis and the human genome sequence. Journal of Structural and Functional Genomics 3 1-4 (2003) 95-110
8. Huang K.-S., Yang C.-B., Tseng K.-T., Peng Y.-H., and Ann H.-Y. Dynamic programming algorithms for the mosaic longest common subsequence problem. Information Processing Letters 102 2-3 (2007) 99-103
9. Jaillon O., et al. Genome duplication in the teleost fish tetraodon nigroviridis reveals the early vertebrate proto-karyotype. Nature 431 7011 (2004) 946-957
10. Kellis M., Birren B.W., and Lander E.S. Proof and evolutionary analysis of ancient genome duplication in the yeast saccharomyces cerevisiae. Nature 428 6983 (2004) 617-624
11. Landau G.M., Myers E., and Ziv-Ukelson M. Two algorithms for lcs consecutive suffix alignment. Combinatorial Pattern Matching. Lecture Notes in Computer Science vol. 3109 (2004), Springer, Berlin, Heidelberg 173-193
12. Landau G.M., Schieber B., and Ziv-Ukelson M. Sparse LCS common substring alignment. Information Processing Letters 88 6 (2003) 259-270
13. Landau G.M., and Ziv-Ukelson M. On the common substring alignment problem. Journal of Algorithms 41 2 (2001) 338-354
14. Maier D. The complexity of some problems on subsequences and supersequences. Journal of the ACM 25 2 (1978) 322-336
15. Ohno S. Evolution by Gene Duplication (1970), Springer, Heidelberg
16. C.-L. Peng, An approach for solving the constrained longest common subsequence problem, Master Thesis, Department of Computer Science and Engineering, National Sun Yat-sen University, Taiwan, July 2003
17. Schmidt J.P. All highest scoring paths in weighted grid graphs and their application to finding all approximate repeats in strings. SIAM Journal on Computing 27 4 (1998) 972-992
18. Smith T.F., and Waterman M.S. Identification of common molecular subsequences. Journal of Molecular Biology 147 1 (1981) 195-197
19. 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
20. Yang I.-H., Huang C.-P., and Chao K.-M. A fast algorithm for computing a longest common increasing subsequence. Information Processing Letters 93 5 (2005) 249-253