Author:
Brodal Gerth Stølting,Kaligosi Kanela,Katriel Irit,Kutz Martin
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Aldous, D., Diaconis, P.: Longest increasing subsequences: From patience sorting to the Baik-Deift-Johansson theorem. Bull. AMS 36(4), 413–432 (1999)
2. Bergroth, L., Hakonen, H., Raita, T.: A survey of longest common subsequence algorithms. In: SPIRE 2000, pp. 39–48. IEEE Computer Society, Los Alamitos (2000)
3. Bespamyatnikh, S., Segal, M.: Enumerating longest increasing subsequences and patience sorting. Inf. Process. Lett. 76(1-2), 7–11 (2000)
4. Lecture Notes in Computer Science;W.-T. Chan,2005
5. Fredman, M.L.: On computing the length of longest increasing subsequences. Discrete Mathematics 11(1), 29–35 (1975)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Near-optimal algorithm to count occurrences of subsequences of a given length;Discrete Mathematics, Algorithms and Applications;2017-05-29
2. Locating Longest Common Subsequences with Limited Penalty;Database Systems for Advanced Applications;2017
3. Fast Plagiarism Detection in Large-Scale Data;Beyond Databases, Architectures and Structures. Towards Efficient Solutions for Data Analysis and Knowledge Representation;2017
4. A linear algorithm for 3-letter longest common weakly increasing subsequence;Information Processing Letters;2013-02
5. A New Efficient Algorithm for Computing the Longest Common Subsequence;Theory of Computing Systems;2008-01-25