Efficient Algorithms for Finding a Longest Common Increasing Subsequence-Reference-Cited by-同舟云学术

Efficient Algorithms for Finding a Longest Common Increasing Subsequence

Published:2005 Issue: Volume: Page:665-674
ISSN:0302-9743
Container-title:Algorithms and Computation
language:
Short-container-title:

Author:

Chan Wun-Tat,Zhang Yong,Fung Stanley P. Y.,Ye Deshi,Zhu Hong

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11602613_67.pdf

Reference14 articles.

1. Bespamyatnikh, S., Segal, M.: Enumerating longest increasing subsequences and patience sorting. Inf. Process. Lett. 76(1-2), 7–11 (2000)

2. Bhat, D.N.: An evolutionary measure for image matching. In: ICPR 1998: Proc. of the 14th International Conference on Pattern Recognition, vol. 1, pp. 850–852. IEEE Computer Society, Los Alamitos (1998)

3. Delcher, A.L., Kasif, S., Fleischmann, R.D., Peterson, J., White, O., Salzberg, S.L.: Alignment of whole genomes. Nucleic Acids Res. 27, 2369–2376 (1999)

4. Hunt, J.W., Szymanski, T.G.: A fast algorithm for computing longest common subsequences. Commun. ACM 20(5), 350–353 (1977)

5. Katriel, I., Kutz, M.: A faster algorithm for computing a longest common increasing subsequence. Research Report MPI-I-2005-1-007, Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken, Germany (March 2005)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Distributed Consensus for Blockchains in Internet-of-Things Networks;Tsinghua Science and Technology;2022-10

2. On the limiting law of the length of the longest common and increasing subsequences in random words;Stochastic Processes and their Applications;2017-05

3. Computing a longest common subsequence that is almost increasing on sequences having no repeated elements;Journal of Discrete Algorithms;2013-05

4. A linear space algorithm for computing a longest common increasing subsequence;Information Processing Letters;2006-09

5. Faster Algorithms for Computing Longest Common Increasing Subsequences;Combinatorial Pattern Matching;2006