11. CPM 2000:
Montreal,
Canada
Raffaele Giancarlo, David Sankoff (Eds.):
Combinatorial Pattern Matching, 11th Annual Symposium, CPM 2000, Montreal, Canada, June 21-23, 2000, Proceedings.
Lecture Notes in Computer Science 1848 Springer 2000, ISBN 3-540-67633-3 
@proceedings{DBLP:conf/cpm/2000,
editor = {Raffaele Giancarlo and
David Sankoff},
title = {Combinatorial Pattern Matching, 11th Annual Symposium, CPM 2000,
Montreal, Canada, June 21-23, 2000, Proceedings},
booktitle = {CPM},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {1848},
year = {2000},
isbn = {3-540-67633-3},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Invited Lectures
Summer School Lectures
Contributed Papers
- Robert Giegerich:
Explaining and Controlling Ambiguity in Dynamic Programming.
46-59
- Sung-Ryul Kim, Kunsoo Park:
A Dynamic Edit Distance Table.
60-68
- David Fernández-Baca, Timo Seppäläinen, Giora Slutzki:
Parametric Multiple Sequence Alignment and Phylogeny Construction.
69-83
- Paul Horton:
Tsukuba BB: A Branch and Bound Algorithm for Local Multiple Sequence Alignment.
84-98
- Bin Ma:
A Polynominal Time Approximation Scheme for the Closest Substring Problem.
99-107
- Leszek Gasieniec, Jesper Jansson, Andrzej Lingas:
Approximation Algorithms for Hamming Clustering Problems.
108-118
- Paola Bonizzoni, Gianluca Della Vedova, Giancarlo Mauri:
Approximating the Maximum Isomorphic Agreement Subtree Is Hard.
119-128
- Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting:
A Faster and Unifying Algorithm for Comparing Trees.
129-142
- Itsik Pe'er, Ron Shamir, Roded Sharan:
Incomplete Directed Perfect Phylogeny.
143-153
- Tao Jiang, Guohui Lin, Bin Ma, Kaizhong Zhang:
The Longest Common Subsequence Problem for Arc-Annotated Sequences.
154-165
- Gonzalo Navarro, Jorma Tarhio:
Boyer-Moore String Matching over Ziv-Lempel Compressed Text.
166-180
- Yusuke Shibata, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa:
A Boyer-Moore Type Algorithm for Compressed Pattern Matching.
181-194
- Juha Kärkkäinen, Gonzalo Navarro, Esko Ukkonen:
Approximate String Matching over Ziv-Lempel Compressed Text.
195-209
- Shmuel T. Klein:
Improving Static Compression Schemes by Alphabet Extension.
210-221
- Nadia El-Mabrouk:
Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments.
222-234
- David Bryant:
A Lower Bound for the Breakpoint Phylogeny Problem.
235-247
- David Liben-Nowell, Jon M. Kleinberg:
Structural Properties and Tractability Results for Linear Synteny.
248-263
- Steven Skiena, Pavel Sumazin:
Shift Error Detection in Standardized Exams.
264-276
- Rolf Backofen:
An Upper Bound for Number of Contacts in the HP-Model on the Face-Centered-Cubic Lattice (FCC).
277-292
- Matthew R. Nelson, Sharon L. Kardia, Charles F. Sing:
The Combinatorial Partitioning Method.
293-304
- Veli Mäkinen:
Compact Suffix Array.
305-319
- Moritz G. Maaß:
Linear Bidirectional On-Line Construction of Affix Trees.
320-334
- Emily Rocke:
Using Suffix Trees for Gapped Motif Discovery.
335-349
- Gonzalo Navarro, Erkki Sutinen, Jani Tanninen, Jorma Tarhio:
Indexing Text with Approximate q-Grams.
350-363
- Cyril Allauzen, Mathieu Raffinot:
Simple Optimal String Matching Algorithm.
364-374
- Sven Rahmann, Eric Rivals:
Exact and Efficient Computation of the Expected Number of Missing and Common Words in Random Texts.
375-387
- Mireille Régnier, Laurent Mouchard:
Periods and Quasiperiods Characterization.
388-396
- Gerth Stølting Brodal, Christian N. S. Pedersen:
Finding Maximal Quasiperiodicities in Strings.
397-411
- Artur Czumaj, Leszek Gasieniec:
On the Complexity of Determining the Period of a String.
412-422
Last update Tue Feb 14 03:52:06 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
