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

deteriorate

书目名称String Processing and Information Retrieval影响因子(影响力)




书目名称String Processing and Information Retrieval影响因子(影响力)学科排名




书目名称String Processing and Information Retrieval网络公开度




书目名称String Processing and Information Retrieval网络公开度学科排名




书目名称String Processing and Information Retrieval被引频次




书目名称String Processing and Information Retrieval被引频次学科排名




书目名称String Processing and Information Retrieval年度引用




书目名称String Processing and Information Retrieval年度引用学科排名




书目名称String Processing and Information Retrieval读者反馈




书目名称String Processing and Information Retrieval读者反馈学科排名

FLIRT

Exaggerate

Grammar Compressed Sequences with Rank/Select Supports ineffective. We introduce grammar-based representations for repetitive sequences, which use up to 10% of the space needed by representations based on statistical compression, and support direct access and rank/select operations within tens of microseconds.

HACK

Efficient Indexing and Representation of Web Access Logsn 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 of the operations within a few tens of microseconds.

Ventilator

Order Preserving Prefix Tableslements at the same positions in both sequences is the same. In this paper we present an efficient algorithm to construct an interesting and useful data structure, namely, prefix table, from the order preserving point of view.

Daily-Value

A 3-Approximation Algorithm for the Multiple Spliced Alignment Problem and Its Application to the Geof the Spliced Alignment Problem, called ., that involves more than one target sequence. Under a metric, this algorithm is proved to be a 3-approximation for the problem and its good practical results compare to those obtained by four heuristics already developed for the Multiple Spliced Alignment Problem.

任命

Improved Filters for the Approximate Suffix-Prefix Overlap Problemo a suffix of the other. Välimäki et al. (Information and Computation, 2012) gave a solution to this problem based on suffix filters. In this work, we propose two improvements to the method of Välimäki et al. that reduce the running time of the computation.

metropolitan

periodontitis

conquer

Succinct Indexes for Reporting Discriminating and Generic Words+ .) for Problem (i) and Problem (ii) respectively. In this paper, we describe succinct indexes of .log. + .(.log.) + .(.) bits space with near optimal query times i.e., .(. + loglog. + .) for both these problems.