A Fast On-Line Algorithm for the Longest Common Subsequence Problem with Constant Alphabet-Reference-Cited by-同舟云学术

A Fast On-Line Algorithm for the Longest Common Subsequence Problem with Constant Alphabet

Published:2012 Issue:1 Volume:E95-A Page:354-361
ISSN:0916-8508
Container-title:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
language:en
Short-container-title:IEICE Trans. Fundamentals

Author:

SAKAI Yoshifumi¹

Affiliation:

1. Graduate School of Agricultural Science, Tohoku University

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Applied Mathematics,Electrical and Electronic Engineering,Computer Graphics and Computer-Aided Design,Signal Processing

Link

http://www.jstage.jst.go.jp/article/transfun/E95.A/1/E95.A_1_354/_pdf

Reference16 articles.

1. Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings

2. [2] A. Apostolico and C. Guerra, “The longest common subsequence problem revisited,” Algorithmica, vol.2, pp.315-336, 1987.

3. [3] L. Bergroth, H. Hakonen, and T. Raita, “A survey of longest common subsequence algorithms,” Proc. Seventh International Symposium on String Processing Information Retrieval, pp.39-48, 2000.

4. [4] M. Crochemore, G.M. Landau, and M. Ziv-Ukelson, “A sub-quadratic sequence alignment algorithm for unrestricted cost,” Proc. thirteenth annual ACM-SIAM symposium on Discrete algorithms, pp.679-688, 2002.

5. [5] F.Y.L. Chin and C.K. Poon, “A fast algorithm for computing longest common subsequences of small alphabet size,” J. Information Processing, vol.13, pp.463-469, 1990.

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

1. An Efficient Algorithm for LCS Problem between Two Arbitrary Sequences;Mathematical Problems in Engineering;2018-11-29

2. New tabulation and sparse dynamic programming based techniques for sequence similarity problems;Discrete Applied Mathematics;2016-10