1 |
Dynamic Suffix Array with Polylogarithmic Queries and Updates ...
|
|
|
|
BASE
|
|
Show details
|
|
2 |
Faster Algorithms for Longest Common Substring ...
|
|
|
|
Abstract:
In the classic longest common substring (LCS) problem, we are given two strings S and T, each of length at most n, over an alphabet of size σ, and we are asked to find a longest string occurring as a fragment of both S and T. Weiner, in his seminal paper that introduced the suffix tree, presented an 𝒪(n log σ)-time algorithm for this problem [SWAT 1973]. For polynomially-bounded integer alphabets, the linear-time construction of suffix trees by Farach yielded an 𝒪(n)-time algorithm for the LCS problem [FOCS 1997]. However, for small alphabets, this is not necessarily optimal for the LCS problem in the word RAM model of computation, in which the strings can be stored in 𝒪(n log σ/log n) space and read in 𝒪(n log σ/log n) time. We show that, in this model, we can compute an LCS in time 𝒪(n log σ / √{log n}), which is sublinear in n if σ = 2^{o(√{log n})} (in particular, if σ = 𝒪(1)), using optimal space 𝒪(n log σ/log n). We then lift our ideas to the problem of computing a k-mismatch LCS, which has received ... : LIPIcs, Vol. 204, 29th Annual European Symposium on Algorithms (ESA 2021), pages 30:1-30:17 ...
|
|
Keyword:
k mismatches; longest common substring; Theory of computation → Pattern matching; wavelet tree
|
|
URL: https://dx.doi.org/10.4230/lipics.esa.2021.30 https://drops.dagstuhl.de/opus/volltexte/2021/14611/
|
|
BASE
|
|
Hide details
|
|
3 |
Breaking the $O(n)$-Barrier in the Construction of Compressed Suffix Arrays ...
|
|
|
|
BASE
|
|
Show details
|
|
5 |
Time-Space Tradeoffs for Finding a Long Common Substring ...
|
|
|
|
BASE
|
|
Show details
|
|
6 |
Time-Space Tradeoffs for Finding a Long Common Substring ...
|
|
|
|
BASE
|
|
Show details
|
|
7 |
Practical Performance of Space Efficient Data Structures for Longest Common Extensions ...
|
|
|
|
BASE
|
|
Show details
|
|
9 |
Longest Unbordered Factor in Quasilinear Time
|
|
Kociumaka, Tomasz; Kundu, Ritu; Mohamed, Manal. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. : LIPIcs - Leibniz International Proceedings in Informatics. 29th International Symposium on Algorithms and Computation (ISAAC 2018), 2018
|
|
BASE
|
|
Show details
|
|
13 |
Efficient Index for Weighted Sequences
|
|
Barton, Carl; Kociumaka, Tomasz; Pissis, Solon P.. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. : LIPIcs - Leibniz International Proceedings in Informatics. 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 2016
|
|
BASE
|
|
Show details
|
|
14 |
Minimal Suffix and Rotation of a Substring in Optimal Time
|
|
Kociumaka, Tomasz. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. : LIPIcs - Leibniz International Proceedings in Informatics. 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 2016
|
|
BASE
|
|
Show details
|
|
15 |
Minimal Suffix and Rotation of a Substring in Optimal Time ...
|
|
Kociumaka, Tomasz. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany, 2016
|
|
BASE
|
|
Show details
|
|
16 |
Sparse Suffix Tree Construction in Optimal Time and Space ...
|
|
|
|
BASE
|
|
Show details
|
|
17 |
Minimal Suffix and Rotation of a Substring in Optimal Time ...
|
|
|
|
BASE
|
|
Show details
|
|
|
|