|
Fundamentalnaya i Prikladnaya Matematika, 2015, Volume 20, Issue 6, Pages 3–16
(Mi fpm1685)
|
|
|
|
Indexing and querying character sets in one- and two-dimensional words
D. Belazzouguia, R. Kolpakovb, M. Raffinotc a University of Helsinki
b Lomonosov Moscow State University
c Université Paris VII – Denis Diderot
Abstract:
We give a detailed review of results obtained for a relatively new problem of finding, indexing, and querying character sets, which are called fingerprints in fragments of one- and two-dimensional words, and explain basic ideas used for obtaining these results.
Citation:
D. Belazzougui, R. Kolpakov, M. Raffinot, “Indexing and querying character sets in one- and two-dimensional words”, Fundam. Prikl. Mat., 20:6 (2015), 3–16; J. Math. Sci., 233:1 (2018), 1–9
Linking options:
https://www.mathnet.ru/eng/fpm1685 https://www.mathnet.ru/eng/fpm/v20/i6/p3
|
|