Pages that link to "Item:Q5168418"
From MaRDI portal
The following pages link to BIT-PARALLEL ALGORITHMS FOR THE MERGED LONGEST COMMON SUBSEQUENCE PROBLEM (Q5168418):
Displaying 6 items.
- New tabulation and sparse dynamic programming based techniques for sequence similarity problems (Q313774) (← links)
- Efficient merged longest common subsequence algorithms for similar sequences (Q1686075) (← links)
- On finding a longest common palindromic subsequence (Q1698702) (← links)
- A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem (Q2502283) (← links)
- EFFICIENT HARDWARE ALGORITHMS FOR <font>N</font> CHOOSE <font>K</font> COUNTERS USING THE BITONIC MERGER (Q3444843) (← links)
- Mining Bit-Parallel LCS-length Algorithms (Q5150933) (← links)