Titlebook: String Processing and Information Retrieval; 21st International S Edleno Moura,Maxime Crochemore Conference proceedings 2014 The Editor(s)

鸟笼

Efficient Compressed Indexing for Approximate Top-, String Retrievalen. This is a basic task in most information retrieval scenarios. The best current implementations require 20–30 bits per character (bpc) and . to 4. microseconds per query, or 12–24 bpc and 1–10 milliseconds per query. We introduce a Lempel-Ziv compressed data structure that occupies 5–10 bpc to an

充满装饰

Texture

Erythropoietin

斗志

Efficient Indexing and Representation of Web Access Logs by web usage mining processes. Our index is able to process a set of operations efficiently, while at the same time maintains the original information in compressed form. Results show that web access logs can be represented using 0.85 to 1.03 times their original (plain) size, while executing most

Favorable

A Compressed Suffix-Array Strategy for Temporal-Graph Indexing., .., ..) indicating that an edge from a vertex .. to a vertex .. is active during the time interval [.., ..). Representing those tuples involves the challenge of not only saving space but also of efficient query processing. Queries of interest for these graphs are both direct and reverse neighbors

Expediency

Succinct Indexes for Reporting Discriminating and Generic Words pattern . (of . characters) and an integer . ∈ [1, .] comes as a query, we can efficiently report all (i) . and (ii) . as defined below:.These problems were introduced by Kucherov et al. [8], and they proposed linear space indexes occupying .(.log.) bits with query times .(. + .) and .(. + loglog. 

chuckle

Order Preserving Prefix Tables fragment which is order-isomorphic with the pattern. Two sequences over integer alphabet are order-isomorphic if the relative order between any two elements at the same positions in both sequences is the same. In this paper we present an efficient algorithm to construct an interesting and useful da

背景

Alphabet-Independent Algorithms for Finding Context-Sensitive Repeats in Linear Timearch for exact or approximate repeats. The notions of maximal and supermaximal (exact) repeats have received special attention, and it is possible to simultaneously compute them on index data structures like the suffix tree or the enhanced suffix array. Very recently, this research has been extended

善于

A 3-Approximation Algorithm for the Multiple Spliced Alignment Problem and Its Application to the Gen-overlapping substrings of a subject sequence . that best fits a target sequence .. In this work we present an approximation algorithm for a variant of the Spliced Alignment Problem, called ., that involves more than one target sequence. Under a metric, this algorithm is proved to be a 3-approximat