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 : 5. annual symposium, CPM '94 : Asilomar, CA, USA, June 5-8, 1994 : proceedings / Maxime Crochemore, Dan Gusfield (eds.)
| Combinatorial pattern matching : 5. annual symposium, CPM '94 : Asilomar, CA, USA, June 5-8, 1994 : proceedings / Maxime Crochemore, Dan Gusfield (eds.) |
| Autore | Annual Symposium on Combinatorial Pattern Matching : <5. : ; 1994 |
| Pubbl/distr/stampa | Berlin [etc.], : Springer-Verlag, c1994 |
| Descrizione fisica | 325 p. ; 24 cm. |
| Disciplina | 006.4015116 |
| Collana | Lecture notes in computer science |
| ISBN |
0387580948
3540580948 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISANNIO-AQ10007134 |
Annual Symposium on Combinatorial Pattern Matching : <5. : ; 1994
|
||
| Berlin [etc.], : Springer-Verlag, c1994 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Sannio | ||
| ||
Combinatorial pattern matching : 4. annual symposium, CPM 93 : Padova, Italy, June 2-4, 1993 : proceedings / A. Apostolico, M. Crochemore, Z. Galil, U. Manber (eds.)
| Combinatorial pattern matching : 4. annual symposium, CPM 93 : Padova, Italy, June 2-4, 1993 : proceedings / A. Apostolico, M. Crochemore, Z. Galil, U. Manber (eds.) |
| Autore | Annual symposium on combinatorial pattern matching : <4. : ; 1993 |
| Pubbl/distr/stampa | Berlin [etc.], : Springer-Verlag, c1993 |
| Descrizione fisica | VIII, 265 p. ; 24 cm. |
| Disciplina | 006.4015116 |
| Collana | Lecture notes in computer science |
| ISBN |
038756764X
354056764X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISANNIO-AQ10003130 |
|
Annual symposium on combinatorial pattern matching : <4. : ; 1993
|
||
| Berlin [etc.], : Springer-Verlag, c1993 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Sannio | ||
| ||
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 | ||
| ||