Titlebook: String Processing and Information Retrieval; 27th International S Christina Boucher,Sharma V. Thankachan Conference proceedings 2020 Spring

轻快走过

CRASS

Contextual Pattern Matchingke little sense in this scenario. For example, the basic pattern matching query “list all the positions where pattern . appears” can produce huge outputs when . appears in an area shared by many documents. All those occurrences are essentially the same..In this paper we propose a new query that can

DEBT

Epidural-Space

Smaller Fully-Functional Bidirectional BWT Indexes provide substantial flexibility in traversing the text and can be used to implement several algorithms. The practical appeal of such indexes is contingent on them being compact, and current designs that are sensitive to the compressibility of the input take either . words of space, where . and . ar

开始没有

Internal Quasiperiod Queries asking for the periods of a given factor. In this paper we investigate (for the first time) internal queries asking for covers (also known as quasiperiods) of a given factor. We propose a data structure that answers such queries in . time for the shortest cover and in . time for a representation of

Pulmonary-Veins

可忽略

Relative Lempel-Ziv Compression of Suffix Arrays, while simultaneously allowing very fast decompression of arbitrary suffix array intervals, facilitating pattern matching. The resulting text index, while somewhat larger (5-10x) than the recent r-index of Gagie, Navarro, and Prezza (Proc. SODA ’18)—still provides significant compression, and allow

NATAL

有权

Multidimensional Period Recovery Motivated by a structural analysis of multidimensional data, we introduce the multidimensional period recovery problem, defined as follows. The input is a .-dimensional text array, with dimensions ., that contains corruptions, while the original text without the corruptions is periodic. The goal is

迅速成长