Pages that link to "Item:Q428842"
From MaRDI portal
The following pages link to Fast algorithms for computing the constrained LCS of run-length encoded strings (Q428842):
Displaying 12 items.
- Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion (Q489728) (← links)
- A faster algorithm for the computation of string convolutions using LZ78 parsing (Q765493) (← links)
- New efficient algorithms for the LCS and constrained LCS problems (Q963324) (← links)
- A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings (Q975491) (← links)
- Near-optimal computation of runs over general alphabet via non-crossing LCE queries (Q1796824) (← links)
- Lyndon factorization algorithms for small alphabets and run-length encoded strings (Q2004905) (← links)
- Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings (Q2032287) (← links)
- Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism (Q2390245) (← links)
- Finding a longest common subsequence between a run-length-encoded string and an uncompressed string (Q2483205) (← links)
- An efficient algorithm for the longest common palindromic subsequence problem (Q2672607) (← links)
- On Computing Average Common Substring Over Run Length Encoded Sequences (Q4611215) (← links)
- Linear-space S-table algorithms for the longest common subsequence problem (Q6104353) (← links)
