Related references
Note: Only part of the references are listed.Fast and Longest Rollercoasters
Pawel Gawrychowski et al.
ALGORITHMICA (2022)
Computing a longest common almost-increasing subsequence of two sequences
Toan Thang Ta et al.
THEORETICAL COMPUTER SCIENCE (2021)
Longest common subsequence in sublinear space
Masashi Kiyomi et al.
INFORMATION PROCESSING LETTERS (2021)
On generalized Lyndon words
Francesco Dolce et al.
THEORETICAL COMPUTER SCIENCE (2019)
The longest commonly positioned increasing subsequences problem
Xiaozhou He et al.
JOURNAL OF COMBINATORIAL OPTIMIZATION (2018)
A hardness result and new algorithm for the longest common palindromic subsequence problem
Shunsuke Inenaga et al.
INFORMATION PROCESSING LETTERS (2018)
THE RUNS THEOREM
Hideo Bannai et al.
SIAM JOURNAL ON COMPUTING (2017)
Tight Hardness Results for LCS and other Sequence Similarity Measures
Amir Abboud et al.
2015 IEEE 56TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (2015)
New algorithms on wavelet trees and applications to information retrieval
Travis Gagie et al.
THEORETICAL COMPUTER SCIENCE (2012)
Faster algorithms for computing longest common increasing subsequences
Martin Kutz et al.
JOURNAL OF DISCRETE ALGORITHMS (2011)
The longest almost-increasing subsequence
Amr Elmasry
INFORMATION PROCESSING LETTERS (2010)
Lowest common ancestors in trees and directed acyclic graphs
MA Bender et al.
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC (2005)
Dynamic LCA queries on trees
R Cole et al.
SIAM JOURNAL ON COMPUTING (2005)