CPM B

29 papers

YearTitle / Authors
2003A Fully Linear-Time Approximation Algorithm for Grammar-Based Compression.
Hiroshi Sakamoto
2003A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions.
Tzvika Hartman
2003Alignment between Two Multiple Alignments.
Bin Ma, Zhuozhi Wang, Kaizhong Zhang
2003An Effective Algorithm for the Peptide De Novo Sequencing from MS/MS Spectrum.
Bin Ma, Kaizhong Zhang, Chengzhi Liang
2003An Exact and Polynomial Distance-Based Algorithm to Reconstruct Single Copy Tandem Duplication Trees.
Olivier Elemento, Olivier Gascuel
2003An Improved Algorithm for Generalized Comparison of Minisatellites.
Behshad Behzadi, Jean-Marc Steyaert
2003Analysis of Tree Edit Distance Algorithms.
Serge Dulucq, Hélène Touzet
2003Average-Optimal Multiple Approximate String Matching.
Kimmo Fredriksson, Gonzalo Navarro
2003Combinatorial Pattern Matching, 14th Annual Symposium, CPM 2003, Morelia, Michocán, Mexico, June 25-27, 2003, Proceedings
Ricardo A. Baeza-Yates, Edgar Chávez, Maxime Crochemore
2003Complexities of the Centre and Median String Problems.
François Nicolas, Eric Rivals
2003Constrained Tree Inclusion.
Gabriel Valiente
2003Distributed and Paged Suffix Trees for Large Genetic Databases.
Raphaël Clifford, Marek J. Sergot
2003Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals.
Haim Kaplan, Elad Verbin
2003Efficient Selection of Unique and Popular Oligos for Large EST Databases.
Jie Zheng, Timothy J. Close, Tao Jiang, Stefano Lonardi
2003Extracting Approximate Patterns.
Johann Pelfrêne, Saïd Abdeddaïm, Joël Alexandre
2003Fast Lightweight Suffix Array Construction and Checking.
Stefan Burkhardt, Juha Kärkkäinen
2003Haplotype Inference by Pure Parsimony.
Dan Gusfield
2003Linear-Time Construction of Suffix Arrays.
Dong Kyue Kim, Jeong Seop Sim, Heejin Park, Kunsoo Park
2003More Efficient Left-to-Right Pattern Matching in Non-sequential Equational Programs.
Nadia Nedjah, Luiza de Macedo Mourelle
2003Multiple Genome Alignment: Chaining Algorithms Revisited.
Mohamed Ibrahim Abouelhoda, Enno Ohlebusch
2003On Minimizing Pattern Splitting in Multi-track String Matching.
Kjell Lemström, Veli Mäkinen
2003Optimal Partitions of Strings: A New Class of Burrows-Wheeler Compression Algorithms.
Raffaele Giancarlo, Marinella Sciortino
2003Optimal Spaced Seeds for Hidden Markov Models, with Application to Homologous Coding Regions.
Brona Brejová, Daniel G. Brown, Tomás Vinar
2003Pattern Discovery in RNA Secondary Structure Using Affix Trees.
Giancarlo Mauri, Giulio Pavesi
2003Space Efficient Linear Time Construction of Suffix Arrays.
Pang Ko, Srinivas Aluru
2003Sparse LCS Common Substring Alignment.
Gad M. Landau, Baruch Schieber, Michal Ziv-Ukelson
2003Tuning String Matching for Huge Pattern Sets.
Jari Kytöjoki, Leena Salmela, Jorma Tarhio
2003Two-Dimensional Pattern Matching with Rotations.
Amihood Amir, Ayelet Butman, Maxime Crochemore, Gad M. Landau, Malka Schaps
2003Working on the Problem of Sorting by Transpositions on Genome Rearrangements.
Maria Emília Telles Walter, Luiz Reginaldo A. F. Curado, Adilton G. Oliveira