A fast algorithm for computing a longest common increasing subsequence-Reference-Cited by-同舟云学术

A fast algorithm for computing a longest common increasing subsequence

Published:2005-03 Issue:5 Volume:93 Page:249-253
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Yang I-Hsuan,Huang Chien-Pin,Chao Kun-Mao

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference13 articles.

1. A survey of longest common subsequence algorithms;Bergroth,2000

2. Enumerating longest increasing subsequences and patience sorting;Bespamyatnikh;Inform. Process. Lett.,2000

3. V. Chvatal, D.A. Klarner, D.E. Knuth, Selected combinatorial research problems, Technical Report, STAN-CS-72-292, Computer Science Department, Stanford University, 1972

4. Alignment of whole genomes;Delcher;Nucleic Acids Res.,1999

5. Fast algorithms for large-scale genome alignment and comparison;Delcher;Nucleic Acids Res.,2002

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

1. The Longest Wave Subsequence Problem: Generalizations of the Longest Increasing Subsequence Problem;International Journal of Foundations of Computer Science;2024-07-12

2. The Merged Longest Common Increasing Subsequence Problem;Communications in Computer and Information Science;2024

3. Parallel Longest Increasing Subsequence and van Emde Boas Trees;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17

4. Computing the longest common almost-increasing subsequence;Theoretical Computer Science;2022-09

5. An efficient algorithm for the longest common palindromic subsequence problem;Theoretical Computer Science;2022-06