Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
String Processing and Information Retrieval [[electronic resource] ] : 21st International Symposium, SPIRE 2014, Ouro Preto, Brazil, October 20-22, 2014, Proceedings / / edited by Edleno Moura, Maxime Crochemore
| String Processing and Information Retrieval [[electronic resource] ] : 21st International Symposium, SPIRE 2014, Ouro Preto, Brazil, October 20-22, 2014, Proceedings / / edited by Edleno Moura, Maxime Crochemore |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XIV, 279 p. 65 illus.) |
| Disciplina | 005 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Information storage and retrieval systems
Pattern recognition systems Algorithms Data mining Database management Information Storage and Retrieval Automated Pattern Recognition Data Mining and Knowledge Discovery Database Management |
| ISBN | 3-319-11918-4 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Record Nr. | UNISA-996213650103316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
String Processing and Information Retrieval : 21st International Symposium, SPIRE 2014, Ouro Preto, Brazil, October 20-22, 2014, Proceedings / / edited by Edleno Moura, Maxime Crochemore
| String Processing and Information Retrieval : 21st International Symposium, SPIRE 2014, Ouro Preto, Brazil, October 20-22, 2014, Proceedings / / edited by Edleno Moura, Maxime Crochemore |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XIV, 279 p. 65 illus.) |
| Disciplina | 005 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Information storage and retrieval systems
Pattern recognition systems Algorithms Data mining Database management Information Storage and Retrieval Automated Pattern Recognition Data Mining and Knowledge Discovery Database Management |
| ISBN | 3-319-11918-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Record Nr. | UNINA-9910483605403321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||