3 |
Unary Words Have the Smallest Levenshtein k-Neighbourhoods
|
|
|
|
In: CPM 2020 - 31st Annual Symposium on Combinatorial Pattern Matching ; https://hal.inria.fr/hal-03085847 ; CPM 2020 - 31st Annual Symposium on Combinatorial Pattern Matching, Jun 2020, Copenhagen, Denmark. pp.1-12, ⟨10.4230/LIPIcs.CPM.2020.10⟩ (2020)
|
|
BASE
|
|
Show details
|
|
7 |
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
|
|
8 |
Order-Preserving Suffix Trees and Their Algorithmic Applications ...
|
|
|
|
BASE
|
|
Show details
|
|
|
|