A fast algorithm for computing a longest common increasing subsequence
Authors:
- 1 March 2005
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 93 (5) , 249-253
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Fast algorithms for large-scale genome alignment and comparisonNucleic Acids Research, 2002
- Enumerating longest increasing subsequences and patience sortingInformation Processing Letters, 2000
- Alignment of whole genomesNucleic Acids Research, 1999
- Good splitters for counting points in trianglesJournal of Algorithms, 1992
- A faster algorithm computing string edit distancesJournal of Computer and System Sciences, 1980
- A fast algorithm for computing longest common subsequencesCommunications of the ACM, 1977
- On computing the length of longest increasing subsequencesDiscrete Mathematics, 1975
- Longest Increasing and Decreasing SubsequencesCanadian Journal of Mathematics, 1961