Mining Bit-Parallel LCS-length Algorithms

DOI10.1007/978-3-319-67428-5_18zbMath1454.68204OpenAlexW2751349338MaRDI QIDQ5150933

Heikki Hyyrö

Publication date: 16 February 2021

Published in: String Processing and Information Retrieval (Search for Journal in Brave)

Full work available at URL: https://trepo.tuni.fi/handle/10024/119236

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites Work

• An O(NP) sequence comparison algorithm
• A fast and practical bit-vector algorithm for the longest common subsequence problem
• A bit-string longest-common-subsequence algorithm
• Bounds on the Complexity of the Longest Common Subsequence Problem
• The String-to-String Correction Problem
• Unnamed Item

This page was built for publication: Mining Bit-Parallel LCS-length Algorithms