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

BAIL

Conference proceedings 2014iology, Web mining and recommender systems. They are organized in topical sections on compression, indexing, genome and related topics, sequences and strings, search, as well as on mining and recommending.

parallelism

古文字学

Conquest

hankering

富饶

600

Sequence Decision Diagrams of constant-length tuples, SeqDDs can store arbitrary finite languages and, as such, should be studied in relation to finite automata. We do so, examining in particular the size of equivalent representations.

Essential

Indexed Matching Statistics and Shortest Unique Substrings shortest unique substrings of a string . in .(|.|log|Σ|) time and in .(|.|log|Σ|) bits of space. A key component of our methods is an encoding of both the unidirectional and the bidirectional statistics that takes 2|.| + .(|.|) bits of space and that allows constant-time access to every position.

朴素

Inkling

Relative Lempel-Ziv with Constant-Time Random AccessIn theory, at the cost of using sublinear extra space, accessing an arbitrary character takes constant time. We show that even in practice this works quite well: e.g., we can compress 36 . genomes from a total of 464 MB to 11 MB and still support random access to them in under 50 nanoseconds per cha