scientific article; zbMATH DE number 1998339

MaRDI QIDQ4432974zbMATH OpenFDO

Authors Maxime Crochemore, Costas S. Iliopoulos, Yoan Pinzón

Publication date 29 October 2003

zbMATH Keywords

bit-parallelismlongest common subsequence

Mathematics Subject Classification ID

Combinatorics on words (68R15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• The longest common subsequence problem revisited
• A fast and practical bit-vector algorithm for the longest common subsequence problem
• An \(O(ND)\) difference algorithm and its variations
• Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings
• New algorithms for the LCS problem

Cited in

(5)

• Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings
• The longest common subsequence problem revisited
• On finding a longest common palindromic subsequence
• Fast DHT algorithms for length N=q*2ᵐ
• Speeding up transposition-invariant string matching

This page was built for publication:

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