电邮这篇文章 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
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
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
补充文件
