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