default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID14th CPM 2003: Morelia, Michocán, Mexico
- Ricardo A. Baeza-Yates
, Edgar Chávez, Maxime Crochemore:
Combinatorial Pattern Matching, 14th Annual Symposium, CPM 2003, Morelia, Michocán, Mexico, June 25-27, 2003, Proceedings. Lecture Notes in Computer Science 2676, Springer 2003, ISBN 3-540-40311-6 - Mohamed Ibrahim Abouelhoda, Enno Ohlebusch:
Multiple Genome Alignment: Chaining Algorithms Revisited. 1-16 - Amihood Amir, Ayelet Butman, Maxime Crochemore, Gad M. Landau, Malka Schaps:
Two-Dimensional Pattern Matching with Rotations. 17-31 - Behshad Behzadi, Jean-Marc Steyaert:
An Improved Algorithm for Generalized Comparison of Minisatellites. 32-41 - Brona Brejová, Daniel G. Brown, Tomás Vinar:
Optimal Spaced Seeds for Hidden Markov Models, with Application to Homologous Coding Regions. 42-54 - Stefan Burkhardt, Juha Kärkkäinen:
Fast Lightweight Suffix Array Construction and Checking. 55-69 - Raphaël Clifford, Marek J. Sergot:
Distributed and Paged Suffix Trees for Large Genetic Databases. 70-82 - Serge Dulucq, Hélène Touzet:
Analysis of Tree Edit Distance Algorithms. 83-95 - Olivier Elemento, Olivier Gascuel:
An Exact and Polynomial Distance-Based Algorithm to Reconstruct Single Copy Tandem Duplication Trees. 96-108 - Kimmo Fredriksson, Gonzalo Navarro:
Average-Optimal Multiple Approximate String Matching. 109-128 - Raffaele Giancarlo, Marinella Sciortino:
Optimal Partitions of Strings: A New Class of Burrows-Wheeler Compression Algorithms. 129-143 - Dan Gusfield:
Haplotype Inference by Pure Parsimony. 144-155 - Tzvika Hartman:
A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions. 156-169 - Haim Kaplan, Elad Verbin:
Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals. 170-185 - Dong Kyue Kim, Jeong Seop Sim, Heejin Park, Kunsoo Park:
Linear-Time Construction of Suffix Arrays. 186-199 - Pang Ko, Srinivas Aluru:
Space Efficient Linear Time Construction of Suffix Arrays. 200-210 - Jari Kytöjoki, Leena Salmela, Jorma Tarhio:
Tuning String Matching for Huge Pattern Sets. 211-224 - Gad M. Landau, Baruch Schieber, Michal Ziv-Ukelson:
Sparse LCS Common Substring Alignment. 225-236 - Kjell Lemström, Veli Mäkinen:
On Minimizing Pattern Splitting in Multi-track String Matching. 237-253 - Bin Ma, Zhuozhi Wang, Kaizhong Zhang:
Alignment between Two Multiple Alignments. 254-265 - Bin Ma, Kaizhong Zhang, Chengzhi Liang:
An Effective Algorithm for the Peptide De Novo Sequencing from MS/MS Spectrum. 266-277 - Giancarlo Mauri, Giulio Pavesi:
Pattern Discovery in RNA Secondary Structure Using Affix Trees. 278-294 - Nadia Nedjah, Luiza de Macedo Mourelle:
More Efficient Left-to-Right Pattern Matching in Non-sequential Equational Programs. 295-314 - François Nicolas, Eric Rivals:
Complexities of the Centre and Median String Problems. 315-327 - Johann Pelfrêne, Saïd Abdeddaïm, Joël Alexandre:
Extracting Approximate Patterns. 328-347 - Hiroshi Sakamoto:
A Fully Linear-Time Approximation Algorithm for Grammar-Based Compression. 348-360 - Gabriel Valiente:
Constrained Tree Inclusion. 361-371 - Maria Emília Telles Walter, Luiz Reginaldo A. F. Curado, Adilton G. Oliveira:
Working on the Problem of Sorting by Transpositions on Genome Rearrangements. 372-383 - Jie Zheng, Timothy J. Close, Tao Jiang, Stefano Lonardi:
Efficient Selection of Unique and Popular Oligos for Large EST Databases. 384-401
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-13 20:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
