| 1 |
Constructing Strings Avoiding Forbidden Substrings
|
|
|
|
In: CPM 2021 - 32nd Annual Symposium on Combinatorial Pattern Matching ; https://hal.inria.fr/hal-03395386 ; CPM 2021 - 32nd Annual Symposium on Combinatorial Pattern Matching, Jul 2021, Wroclaw, Poland. pp.1-18 (2021)
|
|
BASE
|
|
Show details
|
|
|
| 6 |
Bidirectional String Anchors: A New String Sampling Mechanism ...
|
|
|
|
BASE
|
|
Show details
|
|
|
| 8 |
Longest Common Substring Made Fully Dynamic
|
|
|
|
Abstract:
Given two strings S and T, each of length at most n, the longest common substring (LCS) problem is to find a longest substring common to S and T. This is a classical problem in computer science with an O(n)-time solution. In the fully dynamic setting, edit operations are allowed in either of the two strings, and the problem is to find an LCS after each edit. We present the first solution to this problem requiring sublinear time in n per edit operation. In particular, we show how to find an LCS after each edit operation in O~(n^(2/3)) time, after O~(n)-time and space preprocessing. This line of research has been recently initiated in a somewhat restricted dynamic variant by Amir et al. [SPIRE 2017]. More specifically, they presented an O~(n)-sized data structure that returns an LCS of the two strings after a single edit operation (that is reverted afterwards) in O~(1) time. At CPM 2018, three papers (Abedin et al., Funakoshi et al., and Urabe et al.) studied analogously restricted dynamic variants of problems on strings. We show that the techniques we develop can be applied to obtain fully dynamic algorithms for all of these variants. The only previously known sublinear-time dynamic algorithms for problems on strings were for maintaining a dynamic collection of strings for comparison queries and for pattern matching, with the most recent advances made by Gawrychowski et al. [SODA 2018] and by Clifford et al. [STACS 2018]. As an intermediate problem we consider computing the solution for a string with a given set of k edits, which leads us, in particular, to answering internal queries on a string. The input to such a query is specified by a substring (or substrings) of a given string. Data structures for answering internal string queries that were proposed by Kociumaka et al. [SODA 2015] and by Gagie et al. [CCCG 2013] are used, along with new ones, based on ingredients such as the suffix tree, heavy-path decomposition, orthogonal range queries, difference covers, and string periodicity.
|
|
Keyword:
Data processing Computer science; dynamic algorithms; longest common substring; string algorithms
|
|
URN:
urn:nbn:de:0030-drops-111275
|
|
URL: https://doi.org/10.4230/LIPIcs.ESA.2019.6
https://drops.dagstuhl.de/opus/volltexte/2019/11127/
|
|
BASE
|
|
Hide 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
|
|
|
| 10 |
Longest Common Prefixes with $k$-Errors and Applications ...
|
|
|
|
BASE
|
|
Show details
|
|
|
| 16 |
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
|
|
|
| 18 |
Linear-time computation of minimal absent words using suffix array
|
|
|
|
BASE
|
|
Show details
|
|
|
| 19 |
Order-Preserving Suffix Trees and Their Algorithmic Applications ...
|
|
|
|
BASE
|
|
Show details
|
|
|
|
|
