Email this article Indexing and Querying Character Sets in One- and Two-Dimensional Words
- Authors: Belazzougui D.1, Kolpakov R.2, Raffinot M.3
-
Affiliations:
- Department of Computer Science, University of Helsinki
- Department of Mechanics and Mathematics, Moscow State University
- LIAFA, Université Paris Diderot–Paris 7
- Issue: Vol 233, No 1 (2018)
- Pages: 1-9
- Section: Article
- URL: https://ogarev-online.ru/1072-3374/article/view/241508
- DOI: https://doi.org/10.1007/s10958-018-3921-y
- ID: 241508
Cite item
Open Access
Access granted
Subscription Access
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.
About the authors
D. Belazzougui
Department of Computer Science, University of Helsinki
Author for correspondence.
Email: Djamal.Belazzougui@cs.helsinki.fi
Finland, Helsinki
R. Kolpakov
Department of Mechanics and Mathematics, Moscow State University
Email: Djamal.Belazzougui@cs.helsinki.fi
Russian Federation, Moscow
M. Raffinot
LIAFA, Université Paris Diderot–Paris 7
Email: Djamal.Belazzougui@cs.helsinki.fi
France, Paris
Supplementary files
