The SCEAS System
Navigation Menu

Conferences in DBLP

Combinatorial Pattern Matching (CPM) (cpm)
2001 (conf/cpm/2001)

  1. Gonzalo Navarro
    Regular Expression Searching over Ziv-Lempel Compressed Text. [Citation Graph (0, 0)][DBLP]
    CPM, 2001, pp:1-17 [Conf]
  2. Shmuel Tomi Klein, Yair Wiseman
    Parallel Lempel Ziv Coding. [Citation Graph (0, 0)][DBLP]
    CPM, 2001, pp:18-30 [Conf]
  3. 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]
  4. Uzi Vishkin
    What to Do with All this Hardware? (Invited Lecture). [Citation Graph (0, 0)][DBLP]
    CPM, 2001, pp:50- [Conf]
  5. 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]
  6. Stefan Burkhardt, Juha Kärkkäinen
    Better Filtering with Gapped q-Grams. [Citation Graph (0, 0)][DBLP]
    CPM, 2001, pp:73-85 [Conf]
  7. 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]
  8. 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]
  9. Anne Bergeron
    A Very Elementary Presentation of the Hannenhalli-Pevzner Theory. [Citation Graph (0, 0)][DBLP]
    CPM, 2001, pp:106-117 [Conf]
  10. Gary Benson
    Tandem Cyclic Alignment. [Citation Graph (0, 0)][DBLP]
    CPM, 2001, pp:118-130 [Conf]
  11. 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]
  12. Zdenek Tronícek
    Episode Matching. [Citation Graph (0, 0)][DBLP]
    CPM, 2001, pp:143-146 [Conf]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. 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]
  18. 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]
  19. Steffen Heber, Jens Stoye
    Finding All Common Intervals of k Permutations. [Citation Graph (0, 0)][DBLP]
    CPM, 2001, pp:207-218 [Conf]
  20. Christine E. Heitsch
    Generalized Pattern Matching and the Complexity of Unavoidability Testing. [Citation Graph (0, 0)][DBLP]
    CPM, 2001, pp:219-230 [Conf]
  21. S. Rao Kosaraju
    Balanced Suffix Trees (Invited Lecture). [Citation Graph (0, 0)][DBLP]
    CPM, 2001, pp:231- [Conf]
  22. 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]
  23. Jens Gramm, Rolf Niedermeier
    Minimum Quartet Inconsistency Is Fixed Parameter Tractable. [Citation Graph (0, 0)][DBLP]
    CPM, 2001, pp:241-256 [Conf]
  24. 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]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002