FEEDBACK Smiley face
Normal view MARC view ISBD view

String Processing and Information Retrieval [electronic resource] :21st International Symposium, SPIRE 2014, Ouro Preto, Brazil, October 20-22, 2014. Proceedings /

Contributor(s): Moura, Edleno [editor.] | Crochemore, Maxime [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 8799Publisher: Cham : Springer International Publishing : Imprint: Springer, 2014.Description: XIV, 279 p. 65 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783319119182.Subject(s): Computer science | Algorithms | Database management | Data mining | Information storage and retrieval | Pattern recognition | Computer Science | Information Storage and Retrieval | Pattern Recognition | Algorithm Analysis and Problem Complexity | Data Mining and Knowledge Discovery | Database ManagementOnline resources: Click here to access online
Contents:
Compression -- 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.
In: Springer eBooksSummary: This book constitutes the proceedings of the 21st International Symposium on String Processing and Information Retrieval, SPIRE 2014, held in Ouro Preto, Brazil, in October 2014. The 20 full and 6 short papers included in this volume were carefully reviewed and selected from 45 submissions. The papers focus not only on fundamental algorithms in string processing and information retrieval, but address also application areas such as computational biology, 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.
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
No physical items for this record

Compression -- 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.

This book constitutes the proceedings of the 21st International Symposium on String Processing and Information Retrieval, SPIRE 2014, held in Ouro Preto, Brazil, in October 2014. The 20 full and 6 short papers included in this volume were carefully reviewed and selected from 45 submissions. The papers focus not only on fundamental algorithms in string processing and information retrieval, but address also application areas such as computational biology, 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.

There are no comments for this item.

Log in to your account to post a comment.

© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in