The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Brona Brejová, Daniel G. Brown, Ian M. Harrower, Alejandro López-Ortiz, Tomás Vinar
    Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:1-10 [Conf]
  2. Bin Ma, Kaizhong Zhang
    On the Longest Common Rigid Subsequence Problem. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:11-20 [Conf]
  3. Moritz G. Maaß, Johannes Nowak
    Text Indexing with Errors. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:21-32 [Conf]
  4. Dong Kyue Kim, Heejin Park
    A New Compressed Suffix Tree Supporting Fast Search and Its Construction Algorithm Using Optimal Working Space. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:33-44 [Conf]
  5. Veli Mäkinen, Gonzalo Navarro
    Succinct Suffix Arrays Based on Run-Length Encoding. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:45-56 [Conf]
  6. Joong Chae Na
    Linear-Time Construction of Compressed Suffix Arrays Using o(n log n)-Bit Working Space for Large Alphabets. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:57-67 [Conf]
  7. Peter Clifford, Raphaël Clifford, Costas S. Iliopoulos
    Faster Algorithms for delta, gamma-Matching and Related Problems. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:68-78 [Conf]
  8. Zheng Liu, Xin Chen, James Borneman, Tao Jiang
    A Fast Algorithm for Approximate String Matching on Gene Sequences. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:79-90 [Conf]
  9. Amihood Amir, Ohad Lipsky, Ely Porat, Julia Umanski
    Approximate Matching in the L1 Metric. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:91-103 [Conf]
  10. Luís M. S. Russo, Arlindo L. Oliveira
    An Efficient Algorithm for Generating Super Condensed Neighborhoods. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:104-115 [Conf]
  11. Enno Ohlebusch, Mohamed Ibrahim Abouelhoda, Kathrin Hockel, Jan Stallkamp
    The Median Problem for the Reversal Distance in Circular Bacterial Genomes. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:116-127 [Conf]
  12. Gad M. Landau, Laxmi Parida, Oren Weimann
    Using PQ Trees for Comparative Genomics. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:128-143 [Conf]
  13. François Nicolas, Eric Rivals
    Hardness of Optimal Spaced Seed Design. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:144-155 [Conf]
  14. Meng Zhang, Liang Hu, Qiang Li, Jiubin Ju
    Weighted Directed Word Graph. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:156-167 [Conf]
  15. Shiri Dori, Gad M. Landau
    Construction of Aho Corasick Automaton in Linear Time for Integer Alphabets. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:168-177 [Conf]
  16. Sabrina Mantaci, Antonio Restivo, G. Rosone, Marinella Sciortino
    An Extension of the Burrows Wheeler Transform and Applications to Sequence Comparison and Data Compression. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:178-189 [Conf]
  17. Behshad Behzadi, Fabrice Le Fessant
    DNA Compression Challenge Revisited: A Dynamic Programming Approach. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:190-200 [Conf]
  18. Carmel Kent, Gad M. Landau, Michal Ziv-Ukelson
    On the Complexity of Sparse Exon Assembly. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:201-218 [Conf]
  19. Paul Horton, Wataru Fujibuchi
    An Upper Bound on the Hardness of Exact Matrix Based Motif Discovery. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:219-228 [Conf]
  20. Nadia Pisanti, Henry Soldano, Mathilde Carpentier
    Incremental Inference of Relational Motifs with a Degenerate Alphabet. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:229-240 [Conf]
  21. Daniel Fredouille, Christopher H. Bryant
    Speeding up Parsing of Biological Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:241-256 [Conf]
  22. Kangmin Fan, William F. Smyth, R. J. Simpson
    A New Periodicity Lemma. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:257-265 [Conf]
  23. Carmit Hazay, Moshe Lewenstein, Dekel Tsur
    Two Dimensional Parameterized Matching. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:266-279 [Conf]
  24. Gen-Huey Chen, Jin-Ju Hong, Hsueh-I Lu
    An Optimal Algorithm for Online Square Detection. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:280-287 [Conf]
  25. Frantisek Franek, Christopher G. Jennings, William F. Smyth
    A Simple Fast Hybrid Pattern-Matching Algorithm. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:288-297 [Conf]
  26. Yo-Sub Han, Yajun Wang, Derick Wood
    Prefix-Free Regular-Expression Matching. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:298-309 [Conf]
  27. Lucian Ilie, Roberto Solis-Oba, Sheng Yu
    Reducing the Size of NFAs by Using Equivalences and Preorders. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:310-321 [Conf]
  28. Abdullah N. Arslan
    Regular Expression Constrained Sequence Alignment. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:322-333 [Conf]
  29. Hélène Touzet
    A Linear Tree Edit Distance Algorithm for Similar Ordered Trees. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:334-345 [Conf]
  30. Kazuhide Aikou, Yusuke Suzuki, Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara
    A Polynomial Time Matching Algorithm of Ordered Tree Patterns Having Height-Constrained Variables. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:346-357 [Conf]
  31. Valentina Boeva, Julien Clément, Mireille Régnier, Mathias Vandenbogaert
    Assessing the Significance of Sets of Words. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:358-370 [Conf]
  32. Tatsuya Akutsu, Daiji Fukagawa
    Inferring a Graph from Path Frequency. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:371-382 [Conf]
  33. Ion I. Mandoiu, Dragos Trinca
    Exact and Approximation Algorithms for DNA Tag Set Design. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:383-393 [Conf]
  34. David Fernández-Baca, Balaji Venkatachalam
    Parametric Analysis for Ungapped Markov Models of Evolution. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:394-405 [Conf]
  35. Jijun Tang, Bernard M. E. Moret
    Linear Programming for Phylogenetic Reconstruction Based on Gene Rearrangements. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:406-416 [Conf]
  36. Mary Ellen Bock, Guido Maria Cortelazzo, Carlo Ferrari, Concettina Guerra
    Identifying Similar Surface Patches on Proteins Using a Spin-Image Surface Representation. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:417-428 [Conf]
  37. Sebastian Böcker, Hans-Michael Kaltenbach
    Mass Spectra Alignments and Their Significance. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:429-441 [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