On-line pattern matching on similar texts - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

On-line pattern matching on similar texts


Pattern matching on a set of similar texts has received much attention, especially recently, mainly due to its application in cataloguing human genetic variation. In particular, many different algorithms have been proposed for the off-line version of this problem; that is, constructing a compressed index for a set of similar texts in order to answer pattern matching queries efficiently. However, the on-line, more fundamental, version of this problem is a rather undeveloped topic. Solutions to the on-line version can be beneficial for a number of reasons; for instance, efficient on-line solutions can be used in combination with partial indexes as practical trade-offs. We make here an attempt to close this gap via proposing two efficient algorithms for this problem. Notably, one of the algorithms requires time linear in the size of the texts' representation, for short patterns. Furthermore, experimental results confirm our theoretical findings in practical terms.
Fichier principal
Vignette du fichier
CPM17.pdf (779.56 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01526650 , version 1 (23-05-2017)



Roberto P Grossi, Costas S Iliopoulos, Chang Liu, Nadia P Pisanti, Solon P Pissis, et al.. On-line pattern matching on similar texts. 28th Annual Symposium on Combinatorial Pattern Matching (CPM'17), 2017, Varsovie, Poland. pp.7 - 8, ⟨10.4230/LIPIcs.CPM.2017.07⟩. ⟨hal-01526650⟩


213 View
198 Download



Gmail Facebook X LinkedIn More