default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID12th CPM 2001: Jerusalem, Israel
- Amihood Amir, Gad M. Landau:
Combinatorial Pattern Matching, 12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1-4, 2001 Proceedings. Lecture Notes in Computer Science 2089, Springer 2001, ISBN 3-540-42271-4 - Gonzalo Navarro:
Regular Expression Searching over Ziv-Lempel Compressed Text. 1-17 - Shmuel Tomi Klein, Yair Wiseman:
Parallel Lempel Ziv Coding. 18-30 - Veli Mäkinen, Gonzalo Navarro, Esko Ukkonen:
Approximate Matching of Run-Length Compressed Strings. 31-49 - Uzi Vishkin:
What to Do with All this Hardware? (Invited Lecture). 50 - Cyril Allauzen, Maxime Crochemore, Mathieu Raffinot:
Efficient Experimental String Matching by Weak Factor Recognition. 51-72 - Stefan Burkhardt, Juha Kärkkäinen:
Better Filtering with Gapped q-Grams. 73-85 - Abraham Bookstein, Shmuel T. Klein
, Timo Raita:
Fuzzy Hamming Distance: A New Dissimilarity Measure. 86-97 - Aviezri S. Fraenkel, Jamie Simpson:
An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture). 98-105 - Anne Bergeron:
A Very Elementary Presentation of the Hannenhalli-Pevzner Theory. 106-117 - Gary Benson:
Tandem Cyclic Alignment. 118-130 - Laxmi Parida, Isidore Rigoutsos, Daniel E. Platt:
An Output-Sensitive Flexible Pattern Discovery Algorithm. 131-142 - Zdenek Tronícek:
Episode Matching. 143-146 - Masayuki Takeda:
String Resemblance Systems: A Unifying Framework for String Similarity with Applications to Literature and Music. 147-151 - Hiroki Arimura, Hiroki Asaka, Hiroshi Sakamoto, Setsuo Arikawa:
Efficient Discovery of Proximity Patterns with Suffix Arrays. 152-156 - Jean-Marc Champarnaud, Djelloul Ziadi:
Computing the Equation Automaton of a Regular Expression in Space and Time. 157-168 - Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi:
On-Line Construction of Compact Directed Acyclic Word Graphs. 169-180 - Toru Kasai, Gunho Lee, Hiroki Arimura, Setsuo Arikawa, Kunsoo Park:
Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications. 181-192 - Takuya Kida, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa:
Multiple Pattern Matching Algorithms on Collage System. 193-206 - Steffen Heber, Jens Stoye:
Finding All Common Intervals of k Permutations. 207-218 - Christine E. Heitsch:
Generalized Pattern Matching and the Complexity of Unavoidability Testing. 219-230 - S. Rao Kosaraju:
Balanced Suffix Trees (Invited Lecture). 231 - Jesper Jansson, Andrzej Lingas:
A Fast Algorithm for Optimal Alignment between Similar Ordered Trees. 232-240 - Jens Gramm, Rolf Niedermeier:
Minimum Quartet Inconsistency Is Fixed Parameter Tractable. 241-256 - Rolf Backofen, Sebastian Will:
Optimally Compact Finite Sphere Packings - Hydrophobic Cores in the FCC. 257-272
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-06-19 01:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
