Titlebook: Combinatorial Pattern Matching; 23rd Annual Symposiu Juha K?rkk?inen,Jens Stoye Conference proceedings 2012 Springer-Verlag Berlin Heidelbe

Outshine

Venkat Ram Raj Thumiki,Hesham Magdndex proposed by Fischer et al. (LATIN, 2012) can answer this query in . time. However, its space requirement is .(..) bits. We propose the first linear-space index for this problem with a worst case query time of ..

CODA

Hui Liu,Chengming Yu,Haiping Wu, and efficient linear-space solutions are proposed with query time bounds that either do not depend at all on the pattern size or depend on it in a very limited way (doubly logarithmic). As a side result, we propose an improved solution to the . problem.

誘導(dǎo)

Shahid Mumtaz,Jonathan Rodriguezth indexes stored on hard disks and in flash memory. To our knowledge, we report on the first compressed suffix array storing more than 100 GB. Even for the largest collection, most searches completed in under 10 seconds.

彩色

阻擋

CLAN

Cultivate

Cross-Document Pattern Matching, and efficient linear-space solutions are proposed with query time bounds that either do not depend at all on the pattern size or depend on it in a very limited way (doubly logarithmic). As a side result, we propose an improved solution to the . problem.

ABASH

placebo-effect

Narrative

Conference proceedings 2012 July 2012. .The 33 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 60 submissions. The papers address issues of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays. The