Conferences in DBLP
Gonzalo Navarro Regular Expression Searching over Ziv-Lempel Compressed Text. [Citation Graph (0, 0)][DBLP ] CPM, 2001, pp:1-17 [Conf ] Shmuel Tomi Klein , Yair Wiseman Parallel Lempel Ziv Coding. [Citation Graph (0, 0)][DBLP ] CPM, 2001, pp:18-30 [Conf ] Veli Mäkinen , Gonzalo Navarro , Esko Ukkonen Approximate Matching of Run-Length Compressed Strings. [Citation Graph (0, 0)][DBLP ] CPM, 2001, pp:31-49 [Conf ] Uzi Vishkin What to Do with All this Hardware? (Invited Lecture). [Citation Graph (0, 0)][DBLP ] CPM, 2001, pp:50- [Conf ] Cyril Allauzen , Maxime Crochemore , Mathieu Raffinot Efficient Experimental String Matching by Weak Factor Recognition. [Citation Graph (0, 0)][DBLP ] CPM, 2001, pp:51-72 [Conf ] Stefan Burkhardt , Juha Kärkkäinen Better Filtering with Gapped q-Grams. [Citation Graph (0, 0)][DBLP ] CPM, 2001, pp:73-85 [Conf ] Abraham Bookstein , Shmuel T. Klein , Timo Raita Fuzzy Hamming Distance: A New Dissimilarity Measure. [Citation Graph (0, 0)][DBLP ] CPM, 2001, pp:86-97 [Conf ] Aviezri S. Fraenkel , Jamie Simpson An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture). [Citation Graph (0, 0)][DBLP ] CPM, 2001, pp:98-105 [Conf ] Anne Bergeron A Very Elementary Presentation of the Hannenhalli-Pevzner Theory. [Citation Graph (0, 0)][DBLP ] CPM, 2001, pp:106-117 [Conf ] Gary Benson Tandem Cyclic Alignment. [Citation Graph (0, 0)][DBLP ] CPM, 2001, pp:118-130 [Conf ] Laxmi Parida , Isidore Rigoutsos , Daniel E. Platt An Output-Sensitive Flexible Pattern Discovery Algorithm. [Citation Graph (0, 0)][DBLP ] CPM, 2001, pp:131-142 [Conf ] Zdenek Tronícek Episode Matching. [Citation Graph (0, 0)][DBLP ] CPM, 2001, pp:143-146 [Conf ] Masayuki Takeda String Resemblance Systems: A Unifying Framework for String Similarity with Applications to Literature and Music. [Citation Graph (0, 0)][DBLP ] CPM, 2001, pp:147-151 [Conf ] Hiroki Arimura , Hiroki Asaka , Hiroshi Sakamoto , Setsuo Arikawa Efficient Discovery of Proximity Patterns with Suffix Arrays. [Citation Graph (0, 0)][DBLP ] CPM, 2001, pp:152-156 [Conf ] Jean-Marc Champarnaud , Djelloul Ziadi Computing the Equation Automaton of a Regular Expression in Space and Time. [Citation Graph (0, 0)][DBLP ] CPM, 2001, pp:157-168 [Conf ] Shunsuke Inenaga , Hiromasa Hoshino , Ayumi Shinohara , Masayuki Takeda , Setsuo Arikawa , Giancarlo Mauri , Giulio Pavesi On-Line Construction of Compact Directed Acyclic Word Graphs. [Citation Graph (0, 0)][DBLP ] CPM, 2001, pp:169-180 [Conf ] Toru Kasai , Gunho Lee , Hiroki Arimura , Setsuo Arikawa , Kunsoo Park Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications. [Citation Graph (0, 0)][DBLP ] CPM, 2001, pp:181-192 [Conf ] Takuya Kida , Tetsuya Matsumoto , Masayuki Takeda , Ayumi Shinohara , Setsuo Arikawa Multiple Pattern Matching Algorithms on Collage System. [Citation Graph (0, 0)][DBLP ] CPM, 2001, pp:193-206 [Conf ] Steffen Heber , Jens Stoye Finding All Common Intervals of k Permutations. [Citation Graph (0, 0)][DBLP ] CPM, 2001, pp:207-218 [Conf ] Christine E. Heitsch Generalized Pattern Matching and the Complexity of Unavoidability Testing. [Citation Graph (0, 0)][DBLP ] CPM, 2001, pp:219-230 [Conf ] S. Rao Kosaraju Balanced Suffix Trees (Invited Lecture). [Citation Graph (0, 0)][DBLP ] CPM, 2001, pp:231- [Conf ] Jesper Jansson , Andrzej Lingas A Fast Algorithm for Optimal Alignment between Similar Ordered Trees. [Citation Graph (0, 0)][DBLP ] CPM, 2001, pp:232-240 [Conf ] Jens Gramm , Rolf Niedermeier Minimum Quartet Inconsistency Is Fixed Parameter Tractable. [Citation Graph (0, 0)][DBLP ] CPM, 2001, pp:241-256 [Conf ] Rolf Backofen , Sebastian Will Optimally Compact Finite Sphere Packings - Hydrophobic Cores in the FCC. [Citation Graph (0, 0)][DBLP ] CPM, 2001, pp:257-272 [Conf ]