CPM 2000: Montreal, Canada
Raffaele Giancarlo, David Sankoff (Eds.), Lecture Notes in Computer
Science 1848, Springer, 2000
Invited Lectures
- Andrei Z. Broder:
Identifying and Filtering Near-Duplicate Documents.
1-10
download paper
- Fernando C. N. Pereira:
Machine Learning for Efficient Natural-Language Processing.
11
download paper
- Ian H. Witten:
Browsing around a Digital Library: Today and Tomorrow.
12-26
download paper
Summer School Lectures
- Adam L. Buchsbaum, Raffaele Giancarlo:
Algorithmic Aspects of Speech Recognition: A Synopsis.
27-32
download paper
- Laxmi Parida:
Some Results on Flexible-Pattern Discovery.
33-45
download paper
Contributed Papers
- Robert Giegerich:
Explaining and Controlling Ambiguity in Dynamic Programming.
46-59
download paper
- Sung-Ryul Kim, Kunsoo Park:
A Dynamic Edit Distance Table.
60-68
download paper
- David Fernández-Baca, Timo Seppäläinen, Giora Slutzki:
Parametric Multiple Sequence Alignment and Phylogeny Construction.
69-83
download paper
- Paul Horton:
Tsukuba BB: A Branch and Bound Algorithm for Local Multiple Sequence Alignment.
84-98
download paper
- Bin Ma:
A Polynominal Time Approximation Scheme for the Closest Substring Problem.
99-107
download paper
- Leszek Gasieniec, Jesper Jansson, Andrzej Lingas:
Approximation Algorithms for Hamming Clustering Problems.
108-118
download paper
- Paola Bonizzoni, Gianluca Della Vedova, Giancarlo Mauri:
Approximating the Maximum Isomorphic Agreement Subtree Is Hard.
119-128
download paper
- Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting:
A Faster and Unifying Algorithm for Comparing Trees.
129-142
download paper
- Itsik Pe'er, Ron Shamir, Roded Sharan:
Incomplete Directed Perfect Phylogeny.
143-153
download paper
- Tao Jiang, Guo-Hui Lin, Bin Ma, Kaizhong Zhang:
The Longest Common Subsequence Problem for Arc-Annotated Sequences.
154-165
download paper
- Gonzalo Navarro, Jorma Tarhio:
Boyer-Moore String Matching over Ziv-Lempel Compressed Text.
166-180
download paper
- Yusuke Shibata, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa:
A Boyer-Moore Type Algorithm for Compressed Pattern Matching.
181-194
download paper
- Juha Kärkkäinen, Gonzalo Navarro, Esko Ukkonen:
Approximate String Matching over Ziv-Lempel Compressed Text.
195-209
download paper
- Shmuel T. Klein:
Improving Static Compression Schemes by Alphabet Extension.
210-221
download paper
- Nadia El-Mabrouk:
Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments.
222-234
download paper
- David Bryant:
A Lower Bound for the Breakpoint Phylogeny Problem.
235-247
download paper
- David Liben-Nowell, Jon M. Kleinberg:
Structural Properties and Tractability Results for Linear Synteny.
248-263
download paper
- Steven Skiena, Pavel Sumazin:
Shift Error Detection in Standardized Exams.
264-276
download paper
- Rolf Backofen:
An Upper Bound for Number of Contacts in the HP-Model on the Face-Centered-Cubic Lattice (FCC).
277-292
download paper
- Matthew R. Nelson, Sharon L. Kardia, Charles F. Sing:
The Combinatorial Partitioning Method.
293-304
download paper
- Veli Mäkinen:
Compact Suffix Array.
305-319
download paper
- Moritz G. Maaß:
Linear Bidirectional On-Line Construction of Affix Trees.
320-334
download paper
- Emily Rocke:
Using Suffix Trees for Gapped Motif Discovery.
335-349
download paper
- Gonzalo Navarro, Erkki Sutinen, Jani Tanninen, Jorma Tarhio:
Indexing Text with Approximate q-Grams.
350-363
download paper
- Cyril Allauzen, Mathieu Raffinot:
Simple Optimal String Matching Algorithm.
364-374
download paper
- Sven Rahmann, Eric Rivals:
Exact and Efficient Computation of the Expected Number of Missing and Common Words in Random Texts.
375-387
download paper
- Mireille Régnier, Laurent Mouchard:
Periods and Quasiperiods Characterization.
388-396
download paper
- Gerth Stølting Brodal, Christian N. S. Pedersen:
Finding Maximal Quasiperiodicities in Strings.
397-411
download paper
- Artur Czumaj, Leszek Gasieniec:
On the Complexity of Determining the Period of a String.
412-422
download paper