A linear algorithm for 3-letter longest common weakly increasing subsequence

DOI10.1016/j.ipl.2012.11.007zbMath1259.68251OpenAlexW2072324986MaRDI QIDQ1943622

Lech Duraj

Publication date: 20 March 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.11.007

zbMATH Keywords

longest common weakly increasing subsequence

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Related Items (4)

Why is it hard to beat \(O(n^2)\) for longest common weakly increasing subsequence? ⋮ Tight conditional lower bounds for longest common increasing subsequence ⋮ Unnamed Item ⋮ A diagonal-based algorithm for the longest common increasing subsequence problem

This page was built for publication: A linear algorithm for 3-letter longest common weakly increasing subsequence