CPM 2003: Morelia, Michocán, Mexico
Proceedings. Ricardo A. Baeza-Yates, Edgar Chávez, Maxime
Crochemore (Eds.), Lecture Notes in Computer Science 2676, Springer
2003
- Mohamed Ibrahim Abouelhoda, Enno Ohlebusch:
Multiple Genome Alignment: Chaining Algorithms Revisited.
1-16
download paper download presentation (PDF)
- Amihood Amir, Ayelet Butman, Maxime Crochemore, Gad M. Landau, Malka Schaps:
Two-Dimensional Pattern Matching with Rotations.
17-31
download paper
- Behshad Behzadi, Jean-Marc Steyaert:
An Improved Algorithm for Generalized Comparison of Minisatellites.
32-41
download paper
- Brona Brejová, Daniel G. Brown, Tomás Vinar:
Optimal Spaced Seeds for Hidden Markov Models, with Application to Homologous Coding Regions.
42-54
download paper download presentation (PDF)
- Stefan Burkhardt, Juha Kärkkäinen:
Fast Lightweight Suffix Array Construction and Checking.
55-69
download paper download presentation (PDF)
- Raphaël Clifford, Marek J. Sergot:
Distributed and Paged Suffix Trees for Large Genetic Databases.
70-82
download paper download presentation (PDF)
- Serge Dulucq, Hélène Touzet:
Analysis of Tree Edit Distance Algorithms.
83-95
download paper download presentation (PDF)
- Olivier Elemento, Olivier Gascuel:
An Exact and Polynomial Distance-Based Algorithm to Reconstruct Single Copy Tandem Duplication Trees.
96-108
download paper download presentation (PDF)
- Kimmo Fredriksson, Gonzalo Navarro:
Average-Optimal Multiple Approximate String Matching.
109-128
download paper download presentation (PDF)
- Raffaele Giancarlo, Marinella Sciortino:
Optimal Partitions of Strings: A New Class of Burrows-Wheeler Compression Algorithms.
129-143
download paper download presentation (PPT)
- Dan Gusfield:
Haplotype Inference by Pure Parsimony.
144-155
download paper
download presentation (PPT)
- Tzvika Hartman:
A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions.
156-169
download paper download presentation (PPT)
- Haim Kaplan, Elad Verbin:
Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals.
170-185
download paper download presentation (PPT)
- Dong Kyue Kim, Jeong Seop Sim, Heejin Park, Kunsoo Park:
Linear-Time Construction of Suffix Arrays.
186-199
download paper
- Pang Ko, Srinivas Aluru:
Space Efficient Linear Time Construction of Suffix Arrays.
200-210
download paper download presentation (PPT)
- Jari Kytöjoki, Leena Salmela, Jorma Tarhio:
Tuning String Matching for Huge Pattern Sets.
211-224
download paper
- Gad M. Landau, Baruch Schieber, Michal Ziv-Ukelson:
Sparse LCS Common Substring Alignment.
225-236
download paper
download presentation (PPT)
- Kjell Lemström, Veli Mäkinen:
On Minimizing Pattern Splitting in Multi-track String Matching.
237-253
download paper
download presentation (PPT)
- Bin Ma, Zhuozhi Wang, Kaizhong Zhang:
Alignment between Two Multiple Alignments.
254-265
download paper download presentation (PPT)
- Bin Ma, Kaizhong Zhang, Chengzhi Liang:
An Effective Algorithm for the Peptide De Novo Sequencing from MS/MS Spectrum.
266-277
download paper
- Giancarlo Mauri, Giulio Pavesi:
Pattern Discovery in RNA Secondary Structure Using Affix Trees.
278-294
download paper download presentation (PPT)
- Nadia Nedjah, Luiza de Macedo Mourelle:
More Efficient Left-to-Right Pattern Matching in Non-sequential Equational Programs.
295-314
download paper
- François Nicolas, Eric Rivals:
Complexities of the Centre and Median String Problems.
315-327
download paper download presentation (PDF)
- Johann Pelfrêne, Saïd Abdeddaïm, Joël Alexandre:
Extracting Approximate Patterns.
328-347
download paper download presentation (PDF)
- Hiroshi Sakamoto:
A Fully Linear-Time Approximation Algorithm for Grammar-Based Compression.
348-360
download paper
- Gabriel Valiente:
Constrained Tree Inclusion.
361-371
download paper download presentation (PDF)
- Maria Emilia M. T. Walter, Luiz Reginaldo A. F. Curado, Adilton G. Oliveira:
Working on the Problem of Sorting by Transpositions on Genome Rearrangements.
372-383
download paper
- Jie Zheng, Timothy J. Close, Tao Jiang, Stefano Lonardi:
Efficient Selection of Unique and Popular Oligos for Large EST Databases.
384-401
download paper download presentation (PDF) download presentation (PPT)
