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 : 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 | ||
| ||
Fifth Mexican International Conference on Computer Science
| Fifth Mexican International Conference on Computer Science |
| Autore | Baeza-Yates R (Ricardo) |
| Pubbl/distr/stampa | [Place of publication not identified], : IEEE Computer Society Press, 2004 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996199773103316 |
Baeza-Yates R (Ricardo)
|
||
| [Place of publication not identified], : IEEE Computer Society Press, 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||