Отправить статью по E-mail Indexing and Querying Character Sets in One- and Two-Dimensional Words
- Авторы: Belazzougui D.1, Kolpakov R.2, Raffinot M.3
-
Учреждения:
- Department of Computer Science, University of Helsinki
- Department of Mechanics and Mathematics, Moscow State University
- LIAFA, Université Paris Diderot–Paris 7
- Выпуск: Том 233, № 1 (2018)
- Страницы: 1-9
- Раздел: Article
- URL: https://ogarev-online.ru/1072-3374/article/view/241508
- DOI: https://doi.org/10.1007/s10958-018-3921-y
- ID: 241508
Цитировать
Открытый доступ
Доступ предоставлен
Только для подписчиков
Аннотация
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.
Об авторах
D. Belazzougui
Department of Computer Science, University of Helsinki
Автор, ответственный за переписку.
Email: Djamal.Belazzougui@cs.helsinki.fi
Финляндия, Helsinki
R. Kolpakov
Department of Mechanics and Mathematics, Moscow State University
Email: Djamal.Belazzougui@cs.helsinki.fi
Россия, Moscow
M. Raffinot
LIAFA, Université Paris Diderot–Paris 7
Email: Djamal.Belazzougui@cs.helsinki.fi
Франция, Paris
Дополнительные файлы
