BIT-PARALLEL ALGORITHMS FOR THE MERGED LONGEST COMMON SUBSEQUENCE PROBLEM
From MaRDI portal
Publication:5168418
DOI10.1142/S0129054113500342zbMath1311.68203MaRDI QIDQ5168418
Sebastian Deorowicz, Agnieszka Danek
Publication date: 4 July 2014
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Related Items
New tabulation and sparse dynamic programming based techniques for sequence similarity problems, Efficient merged longest common subsequence algorithms for similar sequences, On finding a longest common palindromic subsequence
Cites Work
- A fast algorithm for computing a longest common increasing subsequence
- Speeding up transposition-invariant string matching
- Dynamic programming algorithms for the mosaic longest common subsequence problem
- The constrained longest common subsequence problem
- A fast and practical bit-vector algorithm for the longest common subsequence problem
- Efficient algorithms for finding interleaving relationship between sequences
- A simple algorithm for the constrained sequence problems