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] ] : 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings / / edited by Alberto Apostolico, Maxime Crochemore, Kunsoo Park
| Combinatorial Pattern Matching [[electronic resource] ] : 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings / / edited by Alberto Apostolico, Maxime Crochemore, Kunsoo Park |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XII, 452 p.) |
| Disciplina | 511/.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Artificial intelligence—Data processing Information storage and retrieval systems Natural language processing (Computer science) Pattern recognition systems Bioinformatics Data Science Information Storage and Retrieval Natural Language Processing (NLP) Automated Pattern Recognition |
| ISBN |
3-540-31562-4
3-540-26201-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern -- On the Longest Common Rigid Subsequence Problem -- Text Indexing with Errors -- A New Compressed Suffix Tree Supporting Fast Search and Its Construction Algorithm Using Optimal Working Space -- Succinct Suffix Arrays Based on Run-Length Encoding -- Linear-Time Construction of Compressed Suffix Arrays Using o(n log n)-Bit Working Space for Large Alphabets -- Faster Algorithms for ?,?-Matching and Related Problems -- A Fast Algorithm for Approximate String Matching on Gene Sequences -- Approximate Matching in the L 1 Metric -- An Efficient Algorithm for Generating Super Condensed Neighborhoods -- The Median Problem for the Reversal Distance in Circular Bacterial Genomes -- Using PQ Trees for Comparative Genomics -- Hardness of Optimal Spaced Seed Design -- Weighted Directed Word Graph -- Construction of Aho Corasick Automaton in Linear Time for Integer Alphabets -- An Extension of the Burrows Wheeler Transform and Applications to Sequence Comparison and Data Compression -- DNA Compression Challenge Revisited: A Dynamic Programming Approach -- On the Complexity of Sparse Exon Assembly -- An Upper Bound on the Hardness of Exact Matrix Based Motif Discovery -- Incremental Inference of Relational Motifs with a Degenerate Alphabet -- Speeding up Parsing of Biological Context-Free Grammars -- A New Periodicity Lemma -- Two Dimensional Parameterized Matching -- An Optimal Algorithm for Online Square Detection -- A Simple Fast Hybrid Pattern-Matching Algorithm -- Prefix-Free Regular-Expression Matching -- Reducing the Size of NFAs by Using Equivalences and Preorders -- Regular Expression Constrained Sequence Alignment -- A Linear Tree Edit Distance Algorithm for Similar Ordered Trees -- A Polynomial Time Matching Algorithm of Ordered Tree Patterns Having Height-Constrained Variables -- Assessing the Significance of Sets of Words -- Inferring a Graph from Path Frequency -- Exact and Approximation Algorithms for DNA Tag Set Design -- Parametric Analysis for Ungapped Markov Models of Evolution -- Linear Programming for Phylogenetic Reconstruction Based on Gene Rearrangements -- Identifying Similar Surface Patches on Proteins Using a Spin-Image Surface Representation -- Mass Spectra Alignments and Their Significance. |
| Record Nr. | UNISA-996466120403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Pattern Matching : 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings / / edited by Alberto Apostolico, Maxime Crochemore, Kunsoo Park
| Combinatorial Pattern Matching : 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings / / edited by Alberto Apostolico, Maxime Crochemore, Kunsoo Park |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XII, 452 p.) |
| Disciplina | 511/.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Artificial intelligence—Data processing Information storage and retrieval systems Natural language processing (Computer science) Pattern recognition systems Bioinformatics Data Science Information Storage and Retrieval Natural Language Processing (NLP) Automated Pattern Recognition |
| ISBN |
3-540-31562-4
3-540-26201-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern -- On the Longest Common Rigid Subsequence Problem -- Text Indexing with Errors -- A New Compressed Suffix Tree Supporting Fast Search and Its Construction Algorithm Using Optimal Working Space -- Succinct Suffix Arrays Based on Run-Length Encoding -- Linear-Time Construction of Compressed Suffix Arrays Using o(n log n)-Bit Working Space for Large Alphabets -- Faster Algorithms for ?,?-Matching and Related Problems -- A Fast Algorithm for Approximate String Matching on Gene Sequences -- Approximate Matching in the L 1 Metric -- An Efficient Algorithm for Generating Super Condensed Neighborhoods -- The Median Problem for the Reversal Distance in Circular Bacterial Genomes -- Using PQ Trees for Comparative Genomics -- Hardness of Optimal Spaced Seed Design -- Weighted Directed Word Graph -- Construction of Aho Corasick Automaton in Linear Time for Integer Alphabets -- An Extension of the Burrows Wheeler Transform and Applications to Sequence Comparison and Data Compression -- DNA Compression Challenge Revisited: A Dynamic Programming Approach -- On the Complexity of Sparse Exon Assembly -- An Upper Bound on the Hardness of Exact Matrix Based Motif Discovery -- Incremental Inference of Relational Motifs with a Degenerate Alphabet -- Speeding up Parsing of Biological Context-Free Grammars -- A New Periodicity Lemma -- Two Dimensional Parameterized Matching -- An Optimal Algorithm for Online Square Detection -- A Simple Fast Hybrid Pattern-Matching Algorithm -- Prefix-Free Regular-Expression Matching -- Reducing the Size of NFAs by Using Equivalences and Preorders -- Regular Expression Constrained Sequence Alignment -- A Linear Tree Edit Distance Algorithm for Similar Ordered Trees -- A Polynomial Time Matching Algorithm of Ordered Tree Patterns Having Height-Constrained Variables -- Assessing the Significance of Sets of Words -- Inferring a Graph from Path Frequency -- Exact and Approximation Algorithms for DNA Tag Set Design -- Parametric Analysis for Ungapped Markov Models of Evolution -- Linear Programming for Phylogenetic Reconstruction Based on Gene Rearrangements -- Identifying Similar Surface Patches on Proteins Using a Spin-Image Surface Representation -- Mass Spectra Alignments and Their Significance. |
| Record Nr. | UNINA-9910483301103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial pattern matching : 14th annual symposium, CPM 2003, Morelia, Michoacan, Mexico, June 25-27, 2003 : proceedings. / / Ricardo Baeza-Yates, Edgar Chavez, Maxime Crochemore (editors)
| Combinatorial pattern matching : 14th annual symposium, CPM 2003, Morelia, Michoacan, Mexico, June 25-27, 2003 : proceedings. / / Ricardo Baeza-Yates, Edgar Chavez, Maxime Crochemore (editors) |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin : , : Springer, , [2003] |
| Descrizione fisica | 1 online resource (411 p.) |
| Disciplina | 005.1 |
| Collana | Lecture notes in computer science |
| Soggetto topico | Computer algorithms |
| ISBN |
1-280-80486-6
9786610804863 3-540-44888-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Multiple Genome Alignment: Chaining Algorithms Revisited -- Two-Dimensional Pattern Matching with Rotations -- An Improved Algorithm for Generalized Comparison of Minisatellites -- Optimal Spaced Seeds for Hidden Markov Models, with Application to Homologous Coding Regions -- Fast Lightweight Suffix Array Construction and Checking -- Distributed and Paged Suffix Trees for Large Genetic Databases -- Analysis of Tree Edit Distance Algorithms -- An Exact and Polynomial Distance-Based Algorithm to Reconstruct Single Copy Tandem Duplication Trees -- Average-Optimal Multiple Approximate String Matching -- Optimal Partitions of Strings: A New Class of Burrows-Wheeler Compression Algorithms -- Haplotype Inference by Pure Parsimony -- A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions -- Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals -- Linear-Time Construction of Suffix Arrays -- Space Efficient Linear Time Construction of Suffix Arrays -- Tuning String Matching for Huge Pattern Sets -- Sparse LCS Common Substring Alignment -- On Minimizing Pattern Splitting in Multi-track String Matching -- Alignment between Two Multiple Alignments -- An Effective Algorithm for the Peptide De Novo Sequencing from MS/MS Spectrum -- Pattern Discovery in RNA Secondary Structure Using Affix Trees -- More Efficient Left-to-Right Pattern Matching in Non-sequential Equational Programs -- Complexities of the Centre and Median String Problems -- Extracting Approximate Patterns -- A Fully Linear-Time Approximation Algorithm for Grammar-Based Compression -- Constrained Tree Inclusion -- Working on the Problem of Sorting by Transpositions on Genome Rearrangements -- Efficient Selection of Unique and Popular Oligos for Large EST Databases. |
| Record Nr. | UNISA-996466071903316 |
| Berlin : , : Springer, , [2003] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial pattern matching : 14th annual symposium, CPM 2003, Morelia, Michoacan, Mexico, June 25-27, 2003 : proceedings. / / Ricardo Baeza-Yates, Edgar Chavez, Maxime Crochemore (editors)
| Combinatorial pattern matching : 14th annual symposium, CPM 2003, Morelia, Michoacan, Mexico, June 25-27, 2003 : proceedings. / / Ricardo Baeza-Yates, Edgar Chavez, Maxime Crochemore (editors) |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin : , : Springer, , [2003] |
| Descrizione fisica | 1 online resource (411 p.) |
| Disciplina | 005.1 |
| Collana | Lecture notes in computer science |
| Soggetto topico | Computer algorithms |
| ISBN |
1-280-80486-6
9786610804863 3-540-44888-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Multiple Genome Alignment: Chaining Algorithms Revisited -- Two-Dimensional Pattern Matching with Rotations -- An Improved Algorithm for Generalized Comparison of Minisatellites -- Optimal Spaced Seeds for Hidden Markov Models, with Application to Homologous Coding Regions -- Fast Lightweight Suffix Array Construction and Checking -- Distributed and Paged Suffix Trees for Large Genetic Databases -- Analysis of Tree Edit Distance Algorithms -- An Exact and Polynomial Distance-Based Algorithm to Reconstruct Single Copy Tandem Duplication Trees -- Average-Optimal Multiple Approximate String Matching -- Optimal Partitions of Strings: A New Class of Burrows-Wheeler Compression Algorithms -- Haplotype Inference by Pure Parsimony -- A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions -- Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals -- Linear-Time Construction of Suffix Arrays -- Space Efficient Linear Time Construction of Suffix Arrays -- Tuning String Matching for Huge Pattern Sets -- Sparse LCS Common Substring Alignment -- On Minimizing Pattern Splitting in Multi-track String Matching -- Alignment between Two Multiple Alignments -- An Effective Algorithm for the Peptide De Novo Sequencing from MS/MS Spectrum -- Pattern Discovery in RNA Secondary Structure Using Affix Trees -- More Efficient Left-to-Right Pattern Matching in Non-sequential Equational Programs -- Complexities of the Centre and Median String Problems -- Extracting Approximate Patterns -- A Fully Linear-Time Approximation Algorithm for Grammar-Based Compression -- Constrained Tree Inclusion -- Working on the Problem of Sorting by Transpositions on Genome Rearrangements -- Efficient Selection of Unique and Popular Oligos for Large EST Databases. |
| Record Nr. | UNINA-9910143870803321 |
| Berlin : , : Springer, , [2003] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Pattern Matching [[electronic resource] ] : Fifth Annual Symposium, CPM '94, Asilomar, CA, USA, June 5 - 8, 1994. Proceedings / / edited by Maxime Crochemore, Dan Gusfield
| Combinatorial Pattern Matching [[electronic resource] ] : Fifth Annual Symposium, CPM '94, Asilomar, CA, USA, June 5 - 8, 1994. Proceedings / / edited by Maxime Crochemore, Dan Gusfield |
| Edizione | [1st ed. 1994.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 |
| Descrizione fisica | 1 online resource (IX, 331 p.) |
| Disciplina | 006.4 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Pattern recognition
Discrete mathematics Algorithms Information storage and retrieval Coding theory Information theory Combinatorics Pattern Recognition Discrete Mathematics Algorithm Analysis and Problem Complexity Information Storage and Retrieval Coding and Information Theory |
| ISBN | 3-540-48450-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A space efficient algorithm for finding the best non-overlapping alignment score -- The parameterized complexity of sequence alignment and consensus -- Computing all suboptimal alignments in linear space -- Approximation algorithms for multiple sequence alignment -- A context dependent method for comparing sequences -- Fast identification of approximately matching substrings -- Alignment of trees — An alternative to tree edit -- Parametric recomputing in alignment graphs -- A lossy data compression based on string matching: Preliminary analysis and suboptimal algorithms -- A text compression scheme that allows fast searching directly in the compressed file -- An alphabet-independent optimal parallel search for three dimensional pattern -- Unit route upper bound for string-matching on hypercube -- Computation of squares in a string -- Minimization of sequential transducers -- Shortest common superstrings for strings of random letters -- Maximal common subsequences and minimal common supersequences -- Dictionary-matching on unbounded alphabets: Uniform length dictionaries -- Proximity matching using fixed-queries trees -- Query primitives for tree-structured data -- Multiple matching of parameterized patterns -- Approximate string matching with don't care characters -- Matching with matrix norm minimization -- Approximate string matching and local similarity -- Polynomial-time algorithms for computing characteristic strings -- Recent methods for RNA modeling using stochastic context-free grammars -- Efficient bounds for oriented chromosome inversion distance. |
| Record Nr. | UNISA-996466248203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Pattern Matching [[electronic resource] ] : 4th Annual Symposium, CPM 93, Padova, Italy, June 2-4, 1993. Proceedings / / edited by Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber
| Combinatorial Pattern Matching [[electronic resource] ] : 4th Annual Symposium, CPM 93, Padova, Italy, June 2-4, 1993. Proceedings / / edited by Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber |
| Edizione | [1st ed. 1993.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 |
| Descrizione fisica | 1 online resource (X, 270 p.) |
| Disciplina | 006.4 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Pattern recognition
Algorithms Natural language processing (Computer science) Information storage and retrieval Coding theory Information theory Combinatorics Pattern Recognition Algorithm Analysis and Problem Complexity Natural Language Processing (NLP) Information Storage and Retrieval Coding and Information Theory |
| ISBN | 3-540-47732-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A linear time pattern matching algorithm between a string and a tree -- Tight comparison bounds for the string prefix-matching problem -- 3-D docking of protein molecules -- Minimal separators of two words -- Covering a string -- On the worst-case behaviour of some approximation algorithms for the shortest common supersequence of k strings -- An algorithm for locating non-overlapping regions of maximum alignment score -- Exact and approximation algorithms for the inversion distance between two chromosomes -- The maximum weight trace problem in multiple sequence alignment -- An algorithm for approximate tandem repeats -- Two dimensional pattern matching in a digitized image -- Analysis of a string edit problem in a probabilistic framework -- Detecting false matches in string matching algorithms -- On suboptimal alignments of biological sequences -- A fast filtration algorithm for the substring matching problem -- A unifying look at d-dimensional periodicities and space coverings -- Approximate string-matching over suffix trees -- Multiple sequence comparison and n-dimensional image reconstruction -- A new editing based distance between unordered labeled trees. |
| Record Nr. | UNISA-996466082003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Pattern Matching [[electronic resource] ] : Third Annual Symposium, Tucson, Arizona, USA, April 29 - May 1, 1992. Proceedings / / edited by Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber
| Combinatorial Pattern Matching [[electronic resource] ] : Third Annual Symposium, Tucson, Arizona, USA, April 29 - May 1, 1992. Proceedings / / edited by Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber |
| Edizione | [1st ed. 1992.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 |
| Descrizione fisica | 1 online resource (XI, 293 p.) |
| Disciplina | 006.4 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Pattern recognition
Algorithms Discrete mathematics Natural language processing (Computer science) Information storage and retrieval Coding theory Information theory Pattern Recognition Algorithm Analysis and Problem Complexity Discrete Mathematics Natural Language Processing (NLP) Information Storage and Retrieval Coding and Information Theory |
| ISBN | 3-540-47357-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Probabilistic analysis of generalized suffix trees -- A language approach to string searching evaluation -- Pattern matching with mismatches: A probabilistic analysis and a randomized algorithm -- Fast multiple keyword searching -- Heaviest increasing/common subsequence problems -- Approximate regular expression pattern matching with concave gap penalties -- Matrix longest common subsequence problem, duality and hilbert bases -- From regular expressions to DFA's using compressed NFA's -- Identifying periodic occurrences of a template with applications to protein structure -- Edit distance for genome comparison based on non-local operations -- 3-D substructure matching in protein Molecules -- Fast serial and parallel algorithms for approximate tree matching with VLDC's (Extended Abstract) -- Grammatical tree matching -- Theoretical and empirical comparisons of approximate string matching algorithms -- Fast and practical approximate string matching -- DZ A text compression algorithm for natural languages -- Multiple alignment with guaranteed error bounds and communication cost -- Two algorithms for the longest common subsequence of three (or more) strings -- Color Set Size problem with applications to string matching -- Computing display conflicts in string and circular string visualization -- Efficient randomized dictionary matching algorithms -- Dynamic dictionary matching with failure functions. |
| Record Nr. | UNISA-996465491703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
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 | ||
| ||