New refinement techniques for longest common subsequence algorithms.

DOI10.1007/B14038MaRDI QIDQ5897140zbMATH OpenOpenAlexFDO

Authors Lasse Bergroth, Harri Hakonen, Juri Väisänen

Publication date 9 February 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b14038

zbMATH Keywords

heuristic algorithmslongest common subsequencestring algorithms

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• The longest common subsequence problem revisited
• New algorithms for the LCS problem
• Publication:4862293
• An \(O(ND)\) difference algorithm and its variations
• An almost-linear time and linear space algorithm for the longest common subsequence problem

Cited in

(2)

• Algorithms for subsequence combinatorics
• Tight conditional lower bounds for longest common increasing subsequence

This page was built for publication: New refinement techniques for longest common subsequence algorithms.

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