Faster algorithms for computing longest common increasing subsequences

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4009 LNCS, Issue , 2006, Pages 330-341

  Brodal, Gerth Stølting ^a   Kaligosi, Kanela ^b   Katriel, Irit ^a   Kutz, Martin ^b  

^a AALBORG UNIVERSITY   (Denmark)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER SCIENCE; DATA STRUCTURES; PROBLEM SOLVING;

ALPHABETS; LONGEST COMMON INCREASING SUBSEQUENCES; RUNNING TIME;

ALGORITHMS;

EID: 33746052085     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11780441_30     Document Type: Conference Paper

References (14)

1. D. Aldous and P. Diaconis. Longest increasing subsequences: From patience sorting to the Baik-Deift-Johansson theorem. Bull. AMS, 36(4):413-432, 1999.
2. L. Bergroth, H. Hakonen, and T. Raita. A survey of longest common subsequence algorithms. In SPIRE '00, pages 39-48. IEEE Computer Society, 2000.
3. S. Bespamyatnikh and M. Segal. Enumerating longest increasing subsequences and patience sorting. Inf. Process. Lett., 76(1-2):7-11, 2000.
4. W.-T. Chan, Y. Zhang, S. P.Y. Fung, D. Ye, and H. Zhu. Efficient Algorithms for Finding A Longest Common Increasing Subsequence. In ISAAC '05, 2005.
5. M.L. Fredman. Oil computing the length of longest increasing subsequences. Discrete Mathematics, 11(1):29-35, 1975.
6. H. N. Gabow, J. L. Bentley, and R. E. Tarjan. Scaling and related techniques for geometry problems. In STOC '84, pages 135-143. ACM Press, 1984.
7. D. S. Hirschberg. A linear space algorithm for computing maximal common subsequences. Commun. ACM, 18(6):341-343, 1975.
8. J. W. Hunt and T. G. Szymanski. A fast algorithm for computing longest common subsequences. Commun. ACM, 20(5):350-353, 1977.
9. W.J. Masek and M.S. Paterson. A faster algorithm computing string edit distances. J. Comput. System Sci., 20:18-31, 1980.
10. E. M. McCreight. Priority search trees. SIAM Journal on Computing, 14(2):257-276, 1985.
11. P. van Emde Boas, R. Kaas, and E. Zijlstra. Design and implementation of an efficient priority queue. Mathematical Systems Theory, 10:99-127, 1977.
12. R. A. Wagner and M. J. Fischer. The string-to-string correction problem. J. ACM, 21(1):168-173, 1974.
13. D. E. Willard. Log-logarithmic worst-case range queries are possible in space Theta(N). Inf. Process. Lett., 17(2):81-84, 1983.
14. I.-H. Yang, C.-P. Huang, and K.-M. Chao. A fast algorithm for computing a longest common increasing subsequence. Inf. Process. Lett, 93/5:249-253, 2005.