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.
Combinatorial Pattern Matching [[electronic resource] ] : 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 -- July 1, 2015, Proceedings / / edited by Ferdinando Cicalese, Ely Porat, Ugo Vaccaro
| Combinatorial Pattern Matching [[electronic resource] ] : 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 -- July 1, 2015, Proceedings / / edited by Ferdinando Cicalese, Ely Porat, Ugo Vaccaro |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XIX, 412 p. 69 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Pattern recognition systems
Algorithms Numerical analysis Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Bioinformatics Automated Pattern Recognition Numerical Analysis Discrete Mathematics in Computer Science Data Science Computational and Systems Biology |
| ISBN | 3-319-19929-3 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling -- A Framework for Space-Efficient String Kernels -- Composite Repetition-Aware Data Structures -- Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis -- Longest Common Extensions in Trees -- Longest Common Extensions in Sublinear Space -- Ranked Document Retrieval with Forbidden Pattern -- Parameterized Complexity of Superstring Problems -- On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem -- Fast String Dictionary Lookup with One Error -- On the Readability of Overlap Digraphs -- Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem -- Range Minimum Query Indexes in Higher Dimensions -- Alphabet-Dependent String Searching with Wexponential Search Trees -- Lempel Ziv Computation in Small Space (LZ-CISS) -- Succinct Non-overlapping Indexing -- Encodings of Range Maximum-Sum Segment Queries and Applications -- Compact Indexes for Flexible Top-k Retrieval -- LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding -- Combinatorial RNA Design: Designability and Structure-Approximating Algorithm -- Dictionary Matching with Uneven Gaps -- Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley’s Process -- The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets -- String Powers in Trees -- Online Detection of Repetitions with Backtracking -- Greedy Conjecture for Strings of Length 4 -- Tighter Bounds for the Sum of Irreducible LCP Values -- Parallel External Memory Suffix Sorting -- On Maximal Unbordered Factors -- Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree -- Reporting Consecutive Substring Occurrences Under Bounded Gap Constraints -- A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS Algorithm -- Encoding Nearest Larger Values -- Sorting by Cuts, Joins and Whole Chromosome Duplications. |
| Record Nr. | UNISA-996198521103316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Pattern Matching : 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 -- July 1, 2015, Proceedings / / edited by Ferdinando Cicalese, Ely Porat, Ugo Vaccaro
| Combinatorial Pattern Matching : 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 -- July 1, 2015, Proceedings / / edited by Ferdinando Cicalese, Ely Porat, Ugo Vaccaro |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XIX, 412 p. 69 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Pattern recognition systems
Algorithms Numerical analysis Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Bioinformatics Automated Pattern Recognition Numerical Analysis Discrete Mathematics in Computer Science Data Science Computational and Systems Biology |
| ISBN | 3-319-19929-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling -- A Framework for Space-Efficient String Kernels -- Composite Repetition-Aware Data Structures -- Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis -- Longest Common Extensions in Trees -- Longest Common Extensions in Sublinear Space -- Ranked Document Retrieval with Forbidden Pattern -- Parameterized Complexity of Superstring Problems -- On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem -- Fast String Dictionary Lookup with One Error -- On the Readability of Overlap Digraphs -- Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem -- Range Minimum Query Indexes in Higher Dimensions -- Alphabet-Dependent String Searching with Wexponential Search Trees -- Lempel Ziv Computation in Small Space (LZ-CISS) -- Succinct Non-overlapping Indexing -- Encodings of Range Maximum-Sum Segment Queries and Applications -- Compact Indexes for Flexible Top-k Retrieval -- LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding -- Combinatorial RNA Design: Designability and Structure-Approximating Algorithm -- Dictionary Matching with Uneven Gaps -- Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley’s Process -- The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets -- String Powers in Trees -- Online Detection of Repetitions with Backtracking -- Greedy Conjecture for Strings of Length 4 -- Tighter Bounds for the Sum of Irreducible LCP Values -- Parallel External Memory Suffix Sorting -- On Maximal Unbordered Factors -- Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree -- Reporting Consecutive Substring Occurrences Under Bounded Gap Constraints -- A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS Algorithm -- Encoding Nearest Larger Values -- Sorting by Cuts, Joins and Whole Chromosome Duplications. |
| Record Nr. | UNINA-9910483208003321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
String Processing and Information Retrieval [[electronic resource] ] : 20th International Symposium, SPIRE 2013, Jerusalem, Israel, October 7-9, 2013, Proceedings / / edited by Oren Kurland, Moshe Lewenstein, Ely Porat
| String Processing and Information Retrieval [[electronic resource] ] : 20th International Symposium, SPIRE 2013, Jerusalem, Israel, October 7-9, 2013, Proceedings / / edited by Oren Kurland, Moshe Lewenstein, Ely Porat |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XII, 312 p. 62 illus.) |
| Disciplina | 005.52 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Information storage and retrieval systems
Pattern recognition systems Algorithms Data mining Information Storage and Retrieval Automated Pattern Recognition Data Mining and Knowledge Discovery |
| ISBN | 3-319-02432-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Consolidating and Exploring information via Textual Inference -- Pattern Discovery and Listing in Graphs -- Efficient Approximation of Edit Distance -- Nowcasting with Google Trends -- Space-efficient Construction of the Burrows-Wheeler Transform -- Using Mutual Inuence to Improve Recommendations -- Position-Restricted Substring Searching Over Small Alphabets -- Simulation Study of Multi-threading in Web Search Engine Processors -- Query Processing in Highly-Loaded Search Engines -- Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs -- Adaptive Data Structures for Permutations and Binary Relations -- Document Listing on Versioned Documents -- Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes -- Compact Querieable Representations of Raster Data -- Top-k Color Queries On Tree Paths -- A Lempel-Ziv Compressed Structure for Document Listing -- Minimal Discriminating Words Problem Revisited -- Adding Compression and Blended Search to a Compact Two-Level Suffix Array -- You are what you eat: learning user tastes for rating prediction -- Discovering dense subgraphs in parallel for compressing Web and Social networks -- Faster Lyndon factorization algorithms for SLP and LZ78 compressed text -- Lossless compression of rotated maskless lithography images -- Learning URL Normalization Rules using Multiple Alignment of Sequences -- On Two-Dimensional Lyndon Words -- Fully-Online Grammar Compression -- Solving Graph Isomorphism using Parameterized Matching -- Suffix Array of Alignment: A Practical Index for Similar Data -- Faster Top-k Document Retrieval in Optimal Space -- Faster Range LCP Queries -- Learning to Schedule Webpage Updates Using Genetic Programming -- Accurate Profiling of Microbial Communities from Massively Parallel Sequencing using Convex Optimization -- Distributed Query Processing on Compressed Graphs using K2-Trees. |
| Record Nr. | UNISA-996466028503316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
String Processing and Information Retrieval : 20th International Symposium, SPIRE 2013, Jerusalem, Israel, October 7-9, 2013, Proceedings / / edited by Oren Kurland, Moshe Lewenstein, Ely Porat
| String Processing and Information Retrieval : 20th International Symposium, SPIRE 2013, Jerusalem, Israel, October 7-9, 2013, Proceedings / / edited by Oren Kurland, Moshe Lewenstein, Ely Porat |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XII, 312 p. 62 illus.) |
| Disciplina | 005.52 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Information storage and retrieval systems
Pattern recognition systems Algorithms Data mining Information Storage and Retrieval Automated Pattern Recognition Data Mining and Knowledge Discovery |
| ISBN | 3-319-02432-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Consolidating and Exploring information via Textual Inference -- Pattern Discovery and Listing in Graphs -- Efficient Approximation of Edit Distance -- Nowcasting with Google Trends -- Space-efficient Construction of the Burrows-Wheeler Transform -- Using Mutual Inuence to Improve Recommendations -- Position-Restricted Substring Searching Over Small Alphabets -- Simulation Study of Multi-threading in Web Search Engine Processors -- Query Processing in Highly-Loaded Search Engines -- Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs -- Adaptive Data Structures for Permutations and Binary Relations -- Document Listing on Versioned Documents -- Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes -- Compact Querieable Representations of Raster Data -- Top-k Color Queries On Tree Paths -- A Lempel-Ziv Compressed Structure for Document Listing -- Minimal Discriminating Words Problem Revisited -- Adding Compression and Blended Search to a Compact Two-Level Suffix Array -- You are what you eat: learning user tastes for rating prediction -- Discovering dense subgraphs in parallel for compressing Web and Social networks -- Faster Lyndon factorization algorithms for SLP and LZ78 compressed text -- Lossless compression of rotated maskless lithography images -- Learning URL Normalization Rules using Multiple Alignment of Sequences -- On Two-Dimensional Lyndon Words -- Fully-Online Grammar Compression -- Solving Graph Isomorphism using Parameterized Matching -- Suffix Array of Alignment: A Practical Index for Similar Data -- Faster Top-k Document Retrieval in Optimal Space -- Faster Range LCP Queries -- Learning to Schedule Webpage Updates Using Genetic Programming -- Accurate Profiling of Microbial Communities from Massively Parallel Sequencing using Convex Optimization -- Distributed Query Processing on Compressed Graphs using K2-Trees. |
| Record Nr. | UNINA-9910484682303321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||