Beschreibung
InhaltsangabeCompression.- Strategic Pattern Search in Factor-Compressed Test.- Relative Lempel-Ziv with Constant-Time Random Access.- Efficient Compressed Indexing for Approximate Top-k String Retrieval.- Grammar Compressed Sequences with Rank/Select Support.- Indexing.- Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on Run-Length Encoded Strings.- Relative FM-Indexes.- Efficient Indexing and Representation of Web Access Logs.- A Compressed Suffix-Array Strategy for Temporal-Graph Indexing.- Succinct Indexes for Reporting Discriminating and Generic Words.- Fast Construction of Wavelet Trees.- Order Preserving Prefix Tables.- Genome and Related Topics.- Alphabet-Independent Algorithms for Finding Context-Sensitive Repeats in Linear Time.- A 3-Approximation Algorithm for the Multiple Spliced Alignment Problem and Its Application to the Gene Prediction Task.- Improved Filters for the Approximate Suffix-Prefix Overlap Problem.- Sequences and Strings Sequence Decision.- Diagrams.- Shortest Unique Queries on Strings.- Online Multiple Palindrome Pattern Matching.- Indexed Matching Statistics and Shortest Unique Substrings.- Search.- I/O-Efficient Dictionary Search with One Edit Error.- Online Pattern Matching for String Edit Distance with Moves.- K2-Treaps: Range Top-k Queries in Compact Space.- Performance Improvements for Search Systems Using an Integrated Cache of Lists + Intersections.- Mining and Recommending Information-Theoretic Term Selection for New Item Recommendation.- On the String Consensus Problem and the Manhattan Sequence Consensus Problem.- Context-Aware Deal Size Prediction.- Simple and Efficient String Algorithms for Query Suggestion Metrics Computation.
Herstellerkennzeichnung:
Springer Verlag GmbH
Tiergartenstr. 17
69121 Heidelberg
DE
E-Mail: juergen.hartmann@springer.com
