Bit-parallel algorithms for the merged longest common subsequence problem

DOI10.1142/S0129054113500342MaRDI QIDQ5168418zbMATH OpenFDO

Authors Sebastian Deorowicz, Agnieszka Danek

Publication date 4 July 2014

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054113500342

zbMATH Keywords

bit-parallelismmerged longest common subsequencesequence comparison

Mathematics Subject Classification ID

Algorithms on strings (68W32) Dynamic programming (90C39)

Recommendations

• Efficient merged longest common subsequence algorithms for similar sequences
• A fast and practical bit-vector algorithm for the longest common subsequence problem
• scientific article; zbMATH DE number 278833
• Mining Bit-Parallel LCS-length Algorithms
• Bit-parallel algorithm for the constrained longest common subsequence problem

Cites work

• A fast algorithm for computing a longest common increasing subsequence
• A fast and practical bit-vector algorithm for the longest common subsequence problem
• A simple algorithm for the constrained sequence problems
• Dynamic programming algorithms for the mosaic longest common subsequence problem
• Efficient algorithms for finding interleaving relationship between sequences
• Speeding up transposition-invariant string matching
• The constrained longest common subsequence problem

Cited in

(9)

• Efficient merged longest common subsequence algorithms for similar sequences
• On finding a longest common palindromic subsequence
• Efficient algorithms for finding interleaving relationship between sequences
• A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem
• New tabulation and sparse dynamic programming based techniques for sequence similarity problems
• EFFICIENT HARDWARE ALGORITHMS FOR N CHOOSE K COUNTERS USING THE BITONIC MERGER
• A bit-parallel, general integer-scoring sequence alignment algorithm
• Mining Bit-Parallel LCS-length Algorithms
• The merged longest common increasing subsequence problem

This page was built for publication: Bit-parallel algorithms for the merged longest common subsequence problem

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