The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Jun Ogasawara, Shinichi Morishita
    Practical Software for Aligning ESTs to Human Genome. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:1-16 [Conf]
  2. Hiroki Arimura
    Efficient Text Mining with Optimized Pattern Discovery. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:17-19 [Conf]
  3. Wojciech Rytter
    Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:20-31 [Conf]
  4. Raymond Wan, Alistair Moffat
    Block Merging for Off-Line Compression. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:32-41 [Conf]
  5. Jussi Rautio, Jani Tanninen, Jorma Tarhio
    String Matching with Stopper Encoding and Code Splitting. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:42-52 [Conf]
  6. Stéphane Vialette
    Pattern Matching Problems over 2-Interval Sets. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:53-63 [Conf]
  7. Venkatesan T. Chakaravarthy, Rajasekar Krishnamurthy
    The Problem of Context Sensitive String Matching. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:64-75 [Conf]
  8. Frantisek Franek, Jiandong Jiang, Weilin Lu, William F. Smyth
    Two-Pattern Strings. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:76-84 [Conf]
  9. Dana Shapira, James A. Storer
    Edit Distance with Move Operations. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:85-98 [Conf]
  10. Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier
    Towards Optimally Solving the LONGEST COMMON SUBSEQUENCE Problem for Sequences with Nested Arc Annotations in Linear Time. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:99-114 [Conf]
  11. Veli Mäkinen, Esko Ukkonen
    Local Similarity Based Point-Pattern Matching. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:115-132 [Conf]
  12. Costas S. Iliopoulos, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas
    Identifying Occurrences of Maximal Pairs in Multiple Strings. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:133-143 [Conf]
  13. Wing-Kai Hon, Kunihiko Sadakane
    Space-Economical Algorithms for Finding Maximal Unique Matches. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:144-152 [Conf]
  14. Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara, Hiromasa Hoshino, Setsuo Arikawa
    The Minimum DAWG for All Suffixes of a String and Its Applications. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:153-167 [Conf]
  15. Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott
    On the Complexity of Deriving Position Specific Score Matrices from Examples. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:168-177 [Conf]
  16. Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
    Three Heuristics for delta-Matching: delta-BM Algorithms. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:178-189 [Conf]
  17. Brona Brejová, Tomás Vinar
    A Better Method for Length Distribution Modeling in HMMs and Its Application to Gene Finding. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:190-202 [Conf]
  18. Heikki Hyyrö, Gonzalo Navarro
    Faster Bit-Parallel Approximate String Matching. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:203-224 [Conf]
  19. Stefan Burkhardt, Juha Kärkkäinen
    One-Gapped q-Gram Filtersfor Levenshtein Distance. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:225-234 [Conf]
  20. Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen
    Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:235-248 [Conf]
  21. Süleyman Cenk Sahinalp, Evan E. Eichler, Paul W. Goldberg, Petra Berenbrink, Tom Friedetzky, Funda Ergün
    Statistical Identification of Uniformly Mutated Segments within Repeats. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:249-261 [Conf]
  22. S. Muthukrishnan, Süleyman Cenk Sahinalp
    Simple and Practical Sequence Nearest Neighbors with Block Operations. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:262-278 [Conf]
  23. Lucian Ilie, Sheng Yu
    Constructing NFA s by Optimal Use of Positions in Regular Expressions. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:279-288 [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