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
|
|
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
|
|
12 |
Longest Unbordered Factor in Quasilinear Time ...
|
|
|
|
Abstract:
A border u of a word w is a proper factor of w occurring both as a prefix and as a suffix. The maximal unbordered factor of w is the longest factor of w which does not have a border. Here an O(n log n)-time with high probability (or O(n log n log^2 log n)-time deterministic) algorithm to compute the Longest Unbordered Factor Array of w for general alphabets is presented, where n is the length of w. This array specifies the length of the maximal unbordered factor starting at each position of w. This is a major improvement on the running time of the currently best worst-case algorithm working in O(n^{1.5} ) time for integer alphabets [Gawrychowski et al., 2015]. ... : 17 pages, 5 figures ...
|
|
Keyword:
Data Structures and Algorithms cs.DS; FOS Computer and information sciences
|
|
URL: https://dx.doi.org/10.48550/arxiv.1805.09924 https://arxiv.org/abs/1805.09924
|
|
BASE
|
|
Hide 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
|
|
|
|