RUS  ENG
Full version
JOURNALS // Fundamentalnaya i Prikladnaya Matematika // Archive

Fundam. Prikl. Mat., 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.

UDC: 519.712.43


 English version:
Journal of Mathematical Sciences (New York), 2018, 233:1, 1–9


© Steklov Math. Inst. of RAS, 2024