CPM 2005: Jeju Island, Korea
Invited speakers.
Proceedings.
- Brona Brejova, Daniel G. Brown, Ian M. Harrower, Alejandro Lopez-Ortiz, Tomas Vinar:
Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern. 1-10
download presentation (PDF)
download paper
- Bin Ma, Kaizhong Zhang:
On the Longest Common Rigid Subsequence Problem. 11-20
download presentation (PPT)
download paper
- Moritz G. Maass, Johannes Nowak:
Text Indexing with Errors. 21-32
download presentation (PDF)
download paper
- Dong Kyue Kim, Heejin Park:
A New Compressed Suffix Tree Supporting Fast Search and Its Construction Algorithm Using Optimal Working Space. 33-44
download presentation (PPT)
download paper
- Veli Makinen, Gonzalo Navarro:
Succinct Suffix Arrays Based on Run-Length Encoding. 45-56
download presentation (PPT)
download paper
- Joong Chae Na:
Linear-Time Construction of Compressed Suffix Arrays Using o(n log n)-Bit Working Space for Large Alphabets. 57-67
download presentation (PPT)
download paper
- Peter Clifford, Raphael Clifford, Costas S. Iliopoulos:
Faster Algorithms for delta, gamma-Matching and Related Problems. 68-78
download presentation (PS)
download paper
- Zheng Liu, Xin Chen, James Borneman, Tao Jiang:
A Fast Algorithm for Approximate String Matching on Gene Sequences. 79-90
download presentation (PPT)
download paper
- Amihood Amir, Ohad Lipsky, Ely Porat, Julia Umanski:
Approximate Matching in the L_1 Metric. 91-103
download paper
- Luis M. S. Russo, Arlindo L. Oliveira:
An Efficient Algorithm for Generating Super Condensed Neighborhoods. 104-115
download presentation (PDF)
download paper
- Enno Ohlebusch, Mohamed Ibrahim Abouelhoda, Kathrin Hockel, Jan Stallkamp:
The Median Problem for the Reversal Distance in Circular Bacterial Genomes. 116-127
download presentation (PDF)
download paper
- Gad M. Landau, Laxmi Parida, Oren Weimann:
Using PQ Trees for Comparative Genomics. 128-143
download presentation (PPT)
download paper
- Francois Nicolas, Eric Rivals:
Hardness of Optimal Spaced Seed Design. 144-155
download presentation (PS)
download paper
- Meng Zhang, Liang Hu, Qiang Li, Jiubin Ju:
Weighted Directed Word Graph. 156-167
download presentation (PPT)
download paper
- Shiri Dori, Gad M. Landau:
Construction of Aho Corasick Automaton in Linear Time for Integer Alphabets. 168-177
download presentation (PPT)
download paper
- Sabrina Mantaci, Antonio Restivo, G. Rosone, Marinella Sciortino:
An Extension of the Burrows Wheeler Transform and Applications to Sequence Comparison and Data Compression. 178-189
download presentation (PPT)
download paper
- Behshad Behzadi, Fabrice Le Fessant:
DNA Compression Challenge Revisited: A Dynamic Programming Approach. 190-200
download presentation (PDF)
download paper
- Carmel Kent, Gad M. Landau, Michal Ziv-Ukelson:
On the Complexity of Sparse Exon Assembly. 201-218
download presentation (PPT)
download paper
- Paul Horton, Wataru Fujibuchi:
An Upper Bound on the Hardness of Exact Matrix Based Motif Discovery. 219-228
download presentation (PDF)
download paper
- Nadia Pisanti, Henry Soldano, Mathilde Carpentier:
Incremental Inference of Relational Motifs with a Degenerate Alphabet. 229-240
download presentation (PPT)
download paper
- Daniel Fredouille, Christopher H. Bryant:
Speeding up Parsing of Biological Context-Free Grammars. 241-256
download presentation (PPT)
download paper
- Kangmin Fan, William F. Smyth, R. J. Simpson:
A New Periodicity Lemma. 257-265
download presentation (PPT)
download paper
- Carmit Hazay, Moshe Lewenstein, Dekel Tsur:
Two Dimensional Parameterized Matching. 266-279
download presentation (PPT)
download paper
- Gen-Huey Chen, Jin-Ju Hong, Hsueh-I Lu:
An Optimal Algorithm for Online Square Detection. 280-287
download presentation (PPT)
download paper
- Frantisek Franek, Christopher G. Jennings, William F. Smyth:
A Simple Fast Hybrid Pattern-Matching Algorithm. 288-297
download presentation (PDF)
download paper
- Yo-Sub Han, Yajun Wang, Derick Wood:
Prefix-Free Regular-Expression Matching. 298-309
download presentation (PDF)
download paper
- Lucian Ilie, Roberto Solis-Oba, Sheng Yu:
Reducing the Size of NFAs by Using Equivalences and Preorders.310-321
download presentation (PDF)
download paper
- Abdullah N. Arslan:
Regular Expression Constrained Sequence Alignment. 322-333
download presentation (PPT)
download paper
- Helene Touzet:
A Linear Tree Edit Distance Algorithm for Similar Ordered Trees. 334-345
download presentation (PDF)
download paper
- Kazuhide Aikou, Yusuke Suzuki, Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara:
A Polynomial Time Matching Algorithm of Ordered Tree Patterns Having Height-Constrained Variables. 346-357
download presentation (PPT)
download paper
- Valentina Boeva, Julien Clement, Mireille Regnier, Mathias Vandenbogaert:
Assessing the Significance of Sets of Words. 358-370
download presentation (PDF)
download paper
- Tatsuya Akutsu, Daiji Fukagawa:
Inferring a Graph from Path Frequency. 371-382
download presentation (PDF)
download paper
- Ion I. Mandoiu, Dragos Trinca:
Exact and Approximation Algorithms for DNA Tag Set Design. 383-393
download presentation (PPT)
download paper
- David Fernandez-Baca, Balaji Venkatachalam:
Parametric Analysis for Ungapped Markov Models of Evolution. 394-405
download presentation (PPT)
download paper
- Jijun Tang, Bernard M. E. Moret:
Linear Programming for Phylogenetic Reconstruction Based on Gene Rearrangements. 406-416
download presentation (PDF)
download paper
- Mary Ellen Bock, Guido M. Cortelazzo, Carlo Ferrari, Concettina Guerra:
Identifying Similar Surface Patches on Proteins Using a Spin-Image Surface Representation. 417-428
download presentation (PPT)
download paper
- Sebastian Böcker, Hans-Michael Kaltenbach:
Mass Spectra Alignments and Their Significance. 429-441
download presentation (PDF)
download paper