Combinatorial pattern matching : ; proceedings 14th annual symposium, CPM 2003, Morelia, Michoacán, Mexico, June 25-27, 2003
Enregistré dans:
| Collectivité auteur: | |
|---|---|
| Autres auteurs: | , , |
| Format: | Livre numérique |
| Langue: | Anglais |
| Publié: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Collection: | Lecture notes in computer science
2676 |
| Sujets: | |
| Accès en ligne: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Combinatorial pattern matching, 14th annual symposium, CPM 2003, Morelia, Michoacán, Mexico, June 25-27, 2003, Ricardo Baeza-Yates, Edgar Chávez, Maxime Crochemore (eds.), Berlin, Springer, 2003, 1 vol. (XI-401 p.), Lecture notes in computer science, 3-540-40311-6 • Combinatorial Pattern Matching, Texte imprimé, 9783662208335 |
Table des matières:
- 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.