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

DOI10.1016/J.IPL.2012.11.007MaRDI QIDQ1943622zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Faster Algorithms for Computing Longest Common Increasing Subsequences
• Faster algorithms for computing longest common increasing subsequences
• Algorithms and Computation
• Efficient algorithms for finding a longest common increasing subsequence
• A fast algorithm for computing a longest common increasing subsequence

Cited in

(4)

• Tight conditional lower bounds for longest common increasing subsequence
• Tight conditional lower bounds for longest common increasing subsequence
• Why is it hard to beat \(O(n^2)\) for longest common weakly increasing subsequence?
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1943622)