The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Gary Benson
    A Space Efficient Algorithm for Finding the Best Non-Overlapping Alignment Score. [Citation Graph (0, 0)][DBLP]
    CPM, 1994, pp:1-14 [Conf]
  2. Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham
    The Parameterized Complexity of Sequence Alignment and Consensus. [Citation Graph (0, 0)][DBLP]
    CPM, 1994, pp:15-30 [Conf]
  3. Kun-Mao Chao
    Computing all Suboptimal Alignments in Linear Space. [Citation Graph (0, 0)][DBLP]
    CPM, 1994, pp:31-42 [Conf]
  4. Vineet Bafna, Eugene L. Lawler, Pavel A. Pevzner
    Approximation Algorithms for Multiple Sequence Alignment. [Citation Graph (0, 0)][DBLP]
    CPM, 1994, pp:43-53 [Conf]
  5. Xiaoqiu Huang
    A Context Dependent Method for Comparing Sequences. [Citation Graph (0, 0)][DBLP]
    CPM, 1994, pp:54-63 [Conf]
  6. Archie L. Cobbs
    Fast Identification of Approximately Matching Substrings. [Citation Graph (0, 0)][DBLP]
    CPM, 1994, pp:64-74 [Conf]
  7. Tao Jiang, Lusheng Wang, Kaizhong Zhang
    Alignment of Trees - An Alternative to Tree Edit. [Citation Graph (0, 0)][DBLP]
    CPM, 1994, pp:75-86 [Conf]
  8. Xiaoqiu Huang, Pavel A. Pevzner, Webb Miller
    Parametric Recomuting in Alignment Graphs. [Citation Graph (0, 0)][DBLP]
    CPM, 1994, pp:87-101 [Conf]
  9. Tomasz Luczak, Wojciech Szpankowski
    A Lossy Data Compression Based on String Matching: Preliminary Analysis and Suboptimal Algorithms. [Citation Graph (0, 0)][DBLP]
    CPM, 1994, pp:102-112 [Conf]
  10. Udi Manber
    A Text Compression Scheme That Allows Fast Searching Directly in the Compressed File. [Citation Graph (0, 0)][DBLP]
    CPM, 1994, pp:113-124 [Conf]
  11. Marek Karpinski, Wojciech Rytter
    An Alphabet-Independent Optimal Parallel Search for Three Dimensional Pattern. [Citation Graph (0, 0)][DBLP]
    CPM, 1994, pp:125-135 [Conf]
  12. L. Lestrée
    Unit Route Upper Bound for String-Matching on Hypercube. [Citation Graph (0, 0)][DBLP]
    CPM, 1994, pp:136-145 [Conf]
  13. S. Rao Kosaraju
    Computation of Squares in a String (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    CPM, 1994, pp:146-150 [Conf]
  14. Mehryar Mohri
    Minimization of Sequential Transducers. [Citation Graph (0, 0)][DBLP]
    CPM, 1994, pp:151-163 [Conf]
  15. Kenneth S. Alexander
    Shortest Common Superstrings for Strings of Random Letters. [Citation Graph (0, 0)][DBLP]
    CPM, 1994, pp:164-172 [Conf]
  16. Robert W. Irving, Campbell Fraser
    Maximal Common Subsequences and Minimal Common Supersequences. [Citation Graph (0, 0)][DBLP]
    CPM, 1994, pp:173-183 [Conf]
  17. Dany Breslauer
    Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries. [Citation Graph (0, 0)][DBLP]
    CPM, 1994, pp:184-197 [Conf]
  18. Ricardo A. Baeza-Yates, Walter Cunto, Udi Manber, Sun Wu
    Proximity Matching Using Fixed-Queries Trees. [Citation Graph (3, 0)][DBLP]
    CPM, 1994, pp:198-212 [Conf]
  19. Pekka Kilpeläinen, Heikki Mannila
    Query Primitives for Tree-Structured Data. [Citation Graph (1, 0)][DBLP]
    CPM, 1994, pp:213-225 [Conf]
  20. Ramana M. Idury, Alejandro A. Schäffer
    Multiple Matching of Parameterized Patterns. [Citation Graph (0, 0)][DBLP]
    CPM, 1994, pp:226-239 [Conf]
  21. Tatsuya Akutsu
    Approximate String Matching with Don't Care Characters. [Citation Graph (0, 0)][DBLP]
    CPM, 1994, pp:240-249 [Conf]
  22. Shouwen Tang, Kaizhong Zhang, Xiaolin Wu
    Matching with Matrix Norm Minimization. [Citation Graph (0, 0)][DBLP]
    CPM, 1994, pp:250-258 [Conf]
  23. William I. Chang, Thomas G. Marr
    Approximate String Matching and Local Similarity. [Citation Graph (0, 0)][DBLP]
    CPM, 1994, pp:259-273 [Conf]
  24. Minoru Ito, Kuniyasu Shimizu, Michio Nakanishi, Akihiro Hashimoto
    Polynomial-Time Algorithms for Computing Characteristic Strings. [Citation Graph (0, 0)][DBLP]
    CPM, 1994, pp:274-288 [Conf]
  25. Yasubumi Sakakibara, Michael Brown, Richard Hughey, I. Saira Mian, Kimmen Sjölander, Rebecca C. Underwood, David Haussler
    Recent Methods for RNA Modeling Using Stochastic Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    CPM, 1994, pp:289-306 [Conf]
  26. John D. Kececioglu, David Sankoff
    Efficient Bounds for Oriented Chromosome Inversion Distance. [Citation Graph (0, 0)][DBLP]
    CPM, 1994, pp:307-325 [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