Time-space trade-offs for the longest common substring problem
From MaRDI portal
Publication:4928575
DOI10.1007/978-3-642-38905-4_22zbMATH Open1381.68102OpenAlexW2279569755MaRDI QIDQ4928575FDOQ4928575
Authors: Tatiana Starikovskaya, Hjalte Wedel Vildhøj 
Publication date: 14 June 2013
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38905-4_22
Recommendations
Cited In (16)
- Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
- A substring-substring LCS data structure
- Practical Performance of Space Efficient Data Structures for Longest Common Extensions.
- Linear-time algorithm for long LCF with \(k\) mismatches
- Time-Space Trade-Offs for Longest Common Extensions
- Longest common factor after one edit operation
- Longest common substring with approximately \(k\) mismatches
- Dynamic and internal longest common substring
- Longest property-preserved common factor: a new string-processing framework
- Near-optimal quantum algorithms for string problems
- The substring inclusion constraint longest common subsequence problem can be solved in quadratic time
- Sublinear space algorithms for the longest common substring problem
- Longest common substrings with \(k\) mismatches
- Longest common subsequence in sublinear space
- Longest common substring made fully dynamic
- Linear time algorithms for generalizations of the longest common substring problem
This page was built for publication: Time-space trade-offs for the longest common substring problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4928575)
