Computing a longest common subsequence for a set of strings-Reference-Cited by-同舟云学术

Computing a longest common subsequence for a set of strings

Published:1984-03 Issue:1 Volume:24 Page:45-59
ISSN:0006-3835
Container-title:BIT
language:en
Short-container-title:BIT

Author:

Hsu W. J.,Du M. W.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01934514.pdf

Reference33 articles.

1. A. V. Aho, D. S. Hirschberg and J. D. Ullman,Bounds on the complexity of the longest common subsequence problem, J. Assoc. Comput. Mach. 23(1) (Jan. 1976), 1–12.

2. A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, 2nd printing, Addison-Wesley, Reading, Mass., 1976.

3. V. L. Arlazarov, E. A. Dinic, M. A. Kronrod, and I. A. Faradzev,On economic construction of the transitive closure of a directed graph. Dokl. Akad. Nauk SSSR 194 (1970), 487–488 (in Russian), English transl. in Soviet Math., Dokl. 11, 5 (1970), 1209–1210.

4. V. Chavatal, D. A. Klarner, and D. E. Knuth,Selected combinatorial research problems, STAN-CS-72-292, Stanford Univ., Stanford, Calif. 1972, p. 26.

5. V. Chvatal and D. Sankoff,Longest common subsequences of two random sequences. STAN-CS-75-477, Stanford Univ., Stanford, Calif., Jan. 1975.

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

1. Dynamic-MLCS: Fast searching for dynamic multiple longest common subsequences in sequence stream data;Knowledge-Based Systems;2024-06

2. A Space-Saving Based MLCS Algorithm;2023 IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC/PiCom/CBDCom/CyberSciTech);2023-11-14

3. A novel smart photoelectric lock system: Speech transmitted by laser and speech to text;Heliyon;2023-03

4. A novel match point mapping algorithm based on dominant point for large-scale mlcs problem;2022 18th International Conference on Computational Intelligence and Security (CIS);2022-12

5. A fast and efficient path elimination algorithm for large-scale multiple common longest sequence problems;BMC Bioinformatics;2022-09-07