Titlebook: String Processing and Information Retrieval; 31st International S Zsuzsanna Lipták,Edleno Moura,Ricardo Baeza-Yates Conference proceedings

antiandrogen

Visual-Acuity

,Another Virtue of Wavelet Forests, show experimentally that wavelet forests also have better access locality than wavelet trees and are thus interesting even when higher-order compression is not effective on ., or when . is not a BWT at all.

Fantasy

,All-Pairs Suffix-Prefix on Dynamic Set of Strings,e current set . of . strings, to compute (1) the longest suffix of . that is a prefix of . and (2) the longest prefix of . that is a suffix of . for all .. We propose an .(.)-space data structure which computes (1) and (2) in . time for each new given string ., where . is the total length of the strings.

织布机

会议

托人看管

Bounded-Ratio Gapped String Indexing,ly using an . space structure. In this paper, we bring out an interesting version of the problem where rather than having a fixed upper bound on ., we fix . and allow any . (i.e., allow longer gaps for longer patterns; . is bounded). We show that such queries can be answered optimally using an . space structure.

平息

笼子

Adaptive Dynamic Bitvectors,per update, supports all the operations in . amortized time. Our experimental results support the theoretical findings, displaying speedups of orders of magnitude compared to standard dynamic implementations.

reception

,Compressed Graph Representations for Evaluating Regular Path Queries,ronization, reporting the graph nodes where the automaton reaches final states. We implement this approach on top of a compact graph representation that is particularly well suited for this task. The result is an index using considerably less space and/or query time than all existing approaches.

V切开