Pages that link to "Item:Q2921446"
From MaRDI portal
The following pages link to Sublinear Space Algorithms for the Longest Common Substring Problem (Q2921446):
Displaying 18 items.
- Sparse LCS common substring alignment (Q1029026) (← links)
- A substring-substring LCS data structure (Q1625599) (← links)
- A linear-space algorithm for the substring constrained alignment problem (Q1796823) (← links)
- Dynamic and internal longest common substring (Q2211363) (← links)
- Efficient algorithms for the longest common subsequence in \(k\)-length substrings (Q2252645) (← links)
- Longest property-preserved common factor: a new string-processing framework (Q2297866) (← links)
- Longest common substrings with \(k\) mismatches (Q2345877) (← links)
- The substring inclusion constraint longest common subsequence problem can be solved in quadratic time (Q2376791) (← links)
- Longest common substring with approximately \(k\) mismatches (Q2414870) (← links)
- LP-based heuristics for the distinguishing string and substring selection problems (Q2675721) (← links)
- Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems (Q2701384) (← links)
- On the common substring alignment problem (Q2775894) (← links)
- Approximating LZ77 via Small-Space Multiple-Pattern Matching (Q3452816) (← links)
- Sparse LCS Common Substring Alignment (Q3550838) (← links)
- Longest common substring made fully dynamic (Q5075739) (← links)
- Linear-Time Algorithm for Long LCF with k Mismatches (Q5140788) (← links)
- Longest Common Factor After One Edit Operation (Q5150915) (← links)
- Near-optimal quantum algorithms for string problems (Q6174814) (← links)
