The longest commonly positioned increasing subsequences problem
Authors:
- 9 September 2017
- journal article
- research article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 35 (2) , 331-340
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (71371129)
This publication has 8 references indexed in Scilit:
- Faster algorithms for computing longest common increasing subsequencesJournal of Discrete Algorithms, 2011
- Fast computation of a longest increasing subsequence and applicationInformation and Computation, 2010
- Efficient algorithms for finding a longest common increasing subsequenceJournal of Combinatorial Optimization, 2006
- A fast algorithm for computing a longest common increasing subsequenceInformation Processing Letters, 2005
- A survey of longest common subsequence algorithms2002
- A faster algorithm computing string edit distancesJournal of Computer and System Sciences, 1980
- Preserving order in a forest in less than logarithmic time and linear spaceInformation Processing Letters, 1977
- On computing the length of longest increasing subsequencesDiscrete Mathematics, 1975