Pages that link to "Item:Q1607132"
From MaRDI portal
The following pages link to A fast and practical bit-vector algorithm for the longest common subsequence problem (Q1607132):
Displaying 14 items.
- LCS\(k\): a refined similarity measure (Q294924) (← links)
- Efficient merged longest common subsequence algorithms for similar sequences (Q1686075) (← links)
- An efficient algorithm for LCS problem between two arbitrary sequences (Q1720875) (← links)
- Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism (Q2390245) (← links)
- Practical algorithms for transposition-invariant string-matching (Q2569401) (← links)
- Algorithms in the Ultra-Wide Word Model (Q2948478) (← links)
- FLEXIBLE MUSIC RETRIEVAL IN SUBLINEAR TIME (Q3421849) (← links)
- (Q4638059) (← links)
- Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds (Q4993300) (← links)
- (Q5002674) (← links)
- Mining Bit-Parallel LCS-length Algorithms (Q5150933) (← links)
- BIT-PARALLEL ALGORITHMS FOR THE MERGED LONGEST COMMON SUBSEQUENCE PROBLEM (Q5168418) (← links)
- Linear-space S-table algorithms for the longest common subsequence problem (Q6104353) (← links)
- Longest bordered and periodic subsequences (Q6161459) (← links)
