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] ] : 21st Annual Symposium, CPM 2010, New York, NY, USA, June 21-23, 2010, Proceedings, / / edited by Amihood Amir, Laxmi Parida
| Combinatorial Pattern Matching [[electronic resource] ] : 21st Annual Symposium, CPM 2010, New York, NY, USA, June 21-23, 2010, Proceedings, / / edited by Amihood Amir, Laxmi Parida |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XIII, 362 p. 84 illus.) |
| Disciplina | 006.4015116 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Pattern recognition systems
Life sciences Computer programming Algorithms Artificial intelligence—Data processing Data mining Automated Pattern Recognition Life Sciences Programming Techniques Data Science Data Mining and Knowledge Discovery |
| ISBN |
1-280-38700-9
9786613564924 3-642-13509-9 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithms for Forest Pattern Matching -- Affine Image Matching Is Uniform -Complete -- Old and New in Stringology -- Small-Space 2D Compressed Dictionary Matching -- Bidirectional Search in a String with Wavelet Trees -- A Minimal Periods Algorithm with Applications -- The Property Suffix Tree with Dynamic Properties -- Approximate All-Pairs Suffix/Prefix Overlaps -- Succinct Dictionary Matching with No Slowdown -- Pseudo-realtime Pattern Matching: Closing the Gap -- Breakpoint Distance and PQ-Trees -- On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs -- Succinct Representations of Separable Graphs -- Implicit Hitting Set Problems and Multi-genome Alignment -- Bounds on the Minimum Mosaic of Population Sequences under Recombination -- The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection -- Phylogeny- and Parsimony-Based Haplotype Inference with Constraints -- Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks -- Mod/Resc Parsimony Inference -- Extended Islands of Tractability for Parsimony Haplotyping -- Sampled Longest Common Prefix Array -- Verifying a Parameterized Border Array in O(n 1.5) Time -- Cover Array String Reconstruction -- Compression, Indexing, and Retrieval for Massive String Data -- Building the Minimal Automaton of A * X in Linear Time, When X Is of Bounded Cardinality -- A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach -- Algorithms for Three Versions of the Shortest Common Superstring Problem -- Finding Optimal Alignment and Consensus of Circular Strings -- Optimizing Restriction Site Placement for Synthetic Genomes -- Extension and Faster Implementation of the GRP Transform for Lossless Compression -- Parallel and Distributed Compressed Indexes. |
| Record Nr. | UNISA-996465846203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial pattern matching : 21st Annual Symposium, CPM 2010, New York, NY, USA, June 21-23, 2010 : proceedings / / Amihood Amir, Laxmi Parida (eds.)
| Combinatorial pattern matching : 21st Annual Symposium, CPM 2010, New York, NY, USA, June 21-23, 2010 : proceedings / / Amihood Amir, Laxmi Parida (eds.) |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | New York, : Springer, 2010 |
| Descrizione fisica | 1 online resource (XIII, 362 p. 84 illus.) |
| Disciplina | 006.4015116 |
| Altri autori (Persone) |
AmirAmihood
ParidaLaxmi |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Computer algorithms
Combinatorial analysis |
| ISBN |
1-280-38700-9
9786613564924 3-642-13509-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithms for Forest Pattern Matching -- Affine Image Matching Is Uniform -Complete -- Old and New in Stringology -- Small-Space 2D Compressed Dictionary Matching -- Bidirectional Search in a String with Wavelet Trees -- A Minimal Periods Algorithm with Applications -- The Property Suffix Tree with Dynamic Properties -- Approximate All-Pairs Suffix/Prefix Overlaps -- Succinct Dictionary Matching with No Slowdown -- Pseudo-realtime Pattern Matching: Closing the Gap -- Breakpoint Distance and PQ-Trees -- On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs -- Succinct Representations of Separable Graphs -- Implicit Hitting Set Problems and Multi-genome Alignment -- Bounds on the Minimum Mosaic of Population Sequences under Recombination -- The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection -- Phylogeny- and Parsimony-Based Haplotype Inference with Constraints -- Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks -- Mod/Resc Parsimony Inference -- Extended Islands of Tractability for Parsimony Haplotyping -- Sampled Longest Common Prefix Array -- Verifying a Parameterized Border Array in O(n 1.5) Time -- Cover Array String Reconstruction -- Compression, Indexing, and Retrieval for Massive String Data -- Building the Minimal Automaton of A * X in Linear Time, When X Is of Bounded Cardinality -- A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach -- Algorithms for Three Versions of the Shortest Common Superstring Problem -- Finding Optimal Alignment and Consensus of Circular Strings -- Optimizing Restriction Site Placement for Synthetic Genomes -- Extension and Faster Implementation of the GRP Transform for Lossless Compression -- Parallel and Distributed Compressed Indexes. |
| Record Nr. | UNINA-9910484686603321 |
| New York, : Springer, 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Pattern Matching [[electronic resource] ] : 12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1-4, 2001 Proceedings / / edited by Amihood Amir, Gad M. Landau
| Combinatorial Pattern Matching [[electronic resource] ] : 12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1-4, 2001 Proceedings / / edited by Amihood Amir, Gad M. Landau |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (VIII, 280 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Pattern recognition
Algorithms Information storage and retrieval Coding theory Information theory Combinatorics Pattern Recognition Algorithm Analysis and Problem Complexity Information Storage and Retrieval Coding and Information Theory |
| ISBN | 3-540-48194-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Regular Expression Searching over Ziv-Lempel Compressed Text -- Parallel Lempel Ziv Coding (Extended Abstract) -- Approximate Matching of Run-Length Compressed Strings -- What to Do with All this Hardware? (Invited Lecture) -- Efficient Experimental String Matching by Weak Factor Recognition* -- Better Filtering with Gapped q-Grams -- Fuzzy Hamming Distance: A New Dissimilarity Measure (Extended Abstract) -- An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture) -- A Very Elementary Presentation of the Hannenhalli-Pevzner Theory -- Tandem Cyclic Alignment -- An Output-Sensitive Flexible Pattern Discovery Algorithm -- Episode Matching* -- String Resemblance Systems: A Unifying Framework for String Similarity with Applications to Literature and Music -- Efficient Discovery of Proximity Patterns with Suffix Arrays (Extended Abstract) -- Computing the Equation Automaton of a Regular Expression in O(s 2 ) Space and Time -- On-Line Construction of Compact Directed Acyclic Word Graphs* -- Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications -- Multiple Pattern Matching Algorithms on Collage System -- Finding All Common Intervals of k Permutations -- Generalized Pattern Matching and the Complexity of Unavoidability Testing -- Balanced Suffix Trees (Invited Lecture) -- A Fast Algorithm for Optimal Alignment between Similar Ordered Trees -- Minimum Quartet Inconsistency Is Fixed Parameter Tractable -- Optimally Compact Finite Sphere Packings — Hydrophobic Cores in the FCC. |
| Record Nr. | UNISA-996465794503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Pattern Matching : 12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1-4, 2001 Proceedings / / edited by Amihood Amir, Gad M. Landau
| Combinatorial Pattern Matching : 12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1-4, 2001 Proceedings / / edited by Amihood Amir, Gad M. Landau |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (VIII, 280 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Pattern recognition
Algorithms Information storage and retrieval Coding theory Information theory Combinatorics Pattern Recognition Algorithm Analysis and Problem Complexity Information Storage and Retrieval Coding and Information Theory |
| ISBN | 3-540-48194-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Regular Expression Searching over Ziv-Lempel Compressed Text -- Parallel Lempel Ziv Coding (Extended Abstract) -- Approximate Matching of Run-Length Compressed Strings -- What to Do with All this Hardware? (Invited Lecture) -- Efficient Experimental String Matching by Weak Factor Recognition* -- Better Filtering with Gapped q-Grams -- Fuzzy Hamming Distance: A New Dissimilarity Measure (Extended Abstract) -- An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture) -- A Very Elementary Presentation of the Hannenhalli-Pevzner Theory -- Tandem Cyclic Alignment -- An Output-Sensitive Flexible Pattern Discovery Algorithm -- Episode Matching* -- String Resemblance Systems: A Unifying Framework for String Similarity with Applications to Literature and Music -- Efficient Discovery of Proximity Patterns with Suffix Arrays (Extended Abstract) -- Computing the Equation Automaton of a Regular Expression in O(s 2 ) Space and Time -- On-Line Construction of Compact Directed Acyclic Word Graphs* -- Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications -- Multiple Pattern Matching Algorithms on Collage System -- Finding All Common Intervals of k Permutations -- Generalized Pattern Matching and the Complexity of Unavoidability Testing -- Balanced Suffix Trees (Invited Lecture) -- A Fast Algorithm for Optimal Alignment between Similar Ordered Trees -- Minimum Quartet Inconsistency Is Fixed Parameter Tractable -- Optimally Compact Finite Sphere Packings — Hydrophobic Cores in the FCC. |
| Record Nr. | UNINA-9910143595703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
String Processing and Information Retrieval [[electronic resource] ] : 15th International Symposium, SPIRE 2008, Melbourne, Australia, November 10-12, 2008. Proceedings / / edited by Amihood Amir, Andrew Turpin, Alistair Moffat
| String Processing and Information Retrieval [[electronic resource] ] : 15th International Symposium, SPIRE 2008, Melbourne, Australia, November 10-12, 2008. Proceedings / / edited by Amihood Amir, Andrew Turpin, Alistair Moffat |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (X, 295 p.) |
| Disciplina | 006.312 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Data mining
Computer programming Artificial intelligence Database management Artificial intelligence—Data processing Coding theory Information theory Data Mining and Knowledge Discovery Programming Techniques Artificial Intelligence Database Management Data Science Coding and Information Theory |
| ISBN | 3-540-89097-1 |
| Classificazione | 06.64 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | “Search Is a Solved Problem” and Other Annoying Fallacies -- Approximate Runs - Revisited -- Engineering Radix Sort for Strings -- Faster Text Fingerprinting -- Context-Sensitive Grammar Transform: Compression and Pattern Matching -- Improved Variable-to-Fixed Length Codes -- Term Impacts as Normalized Term Frequencies for BM25 Similarity Scoring -- The Effect of Weighted Term Frequencies on Probabilistic Latent Semantic Term Relationships -- Comparison of s-gram Proximity Measures in Out-of-Vocabulary Word Translation -- Speeding Up Pattern Matching by Text Sampling -- Mismatch Sampling -- Sliding CDAWG Perfection -- Self-indexing Natural Language -- New Perspectives on the Prefix Array -- Indexed Hierarchical Approximate String Matching -- An Efficient Linear Space Algorithm for Consecutive Suffix Alignment under Edit Distance (Short Preliminary Paper) -- Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections -- Practical Rank/Select Queries over Arbitrary Sequences -- Clique Analysis of Query Log Graphs -- Out of the Box Phrase Indexing -- Approximated Pattern Matching with the L 1, L 2 and L ??? Metrics -- Interchange Rearrangement: The Element-Cost Model -- ?? – Parameterized Matching -- Pattern Matching with Pair Correlation Distance -- Some Approximations for Shortest Common Nonsubsequences and Supersequences -- On the Structure of Small Motif Recognition Instances -- Exact Distribution of a Spaced Seed Statistic for DNA Homology Detection. |
| Record Nr. | UNISA-996465904703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
String processing and information retrieval : 15th International Symposium, SPIRE 2008, Melbourne, Australia, November 10-12, 2008 : proceedings / / Amihood Amir, Andrew Turpin, Alistair Moffat (eds.)
| String processing and information retrieval : 15th International Symposium, SPIRE 2008, Melbourne, Australia, November 10-12, 2008 : proceedings / / Amihood Amir, Andrew Turpin, Alistair Moffat (eds.) |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, : Springer, c2008 |
| Descrizione fisica | 1 online resource (X, 295 p.) |
| Disciplina | 006.312 |
| Altri autori (Persone) |
AmirAmihood
TurpinAndrew MoffatAlistair |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Information retrieval
Information storage and retrieval systems |
| ISBN | 3-540-89097-1 |
| Classificazione | 06.64 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | “Search Is a Solved Problem” and Other Annoying Fallacies -- Approximate Runs - Revisited -- Engineering Radix Sort for Strings -- Faster Text Fingerprinting -- Context-Sensitive Grammar Transform: Compression and Pattern Matching -- Improved Variable-to-Fixed Length Codes -- Term Impacts as Normalized Term Frequencies for BM25 Similarity Scoring -- The Effect of Weighted Term Frequencies on Probabilistic Latent Semantic Term Relationships -- Comparison of s-gram Proximity Measures in Out-of-Vocabulary Word Translation -- Speeding Up Pattern Matching by Text Sampling -- Mismatch Sampling -- Sliding CDAWG Perfection -- Self-indexing Natural Language -- New Perspectives on the Prefix Array -- Indexed Hierarchical Approximate String Matching -- An Efficient Linear Space Algorithm for Consecutive Suffix Alignment under Edit Distance (Short Preliminary Paper) -- Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections -- Practical Rank/Select Queries over Arbitrary Sequences -- Clique Analysis of Query Log Graphs -- Out of the Box Phrase Indexing -- Approximated Pattern Matching with the L 1, L 2 and L ??? Metrics -- Interchange Rearrangement: The Element-Cost Model -- ?? – Parameterized Matching -- Pattern Matching with Pair Correlation Distance -- Some Approximations for Shortest Common Nonsubsequences and Supersequences -- On the Structure of Small Motif Recognition Instances -- Exact Distribution of a Spaced Seed Statistic for DNA Homology Detection. |
| Record Nr. | UNINA-9910767534203321 |
| Berlin, : Springer, c2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||