Conferences in DBLP

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

1. Ricardo A. Baeza-Yates, Gonzalo Navarro
   A Faster Algorithm for Approximate String Matching. [Citation Graph (1, 0)][DBLP]
   CPM, 1996, pp:1-23 [Conf]
   
2. Nadia El-Mabrouk, Maxime Crochemore
   Boyer-Moore Strategy to Efficient Approximate String Matching. [Citation Graph (0, 0)][DBLP]
   CPM, 1996, pp:24-38 [Conf]
   
3. Leszek Gasieniec, Marek Karpinski, Wojciech Plandowski, Wojciech Rytter
   Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract). [Citation Graph (0, 0)][DBLP]
   CPM, 1996, pp:39-49 [Conf]
   
4. Erkki Sutinen, Jorma Tarhio
   Filtration with q-Samples in Approximate String Matching. [Citation Graph (0, 0)][DBLP]
   CPM, 1996, pp:50-63 [Conf]
   
5. David J. Lipman
   Computing Discoveries in Molecular Biology (Abstract). [Citation Graph (0, 0)][DBLP]
   CPM, 1996, pp:64- [Conf]
   
6. Gerth Stølting Brodal, Leszek Gasieniec
   Approximate Dictionary Queries. [Citation Graph (0, 0)][DBLP]
   CPM, 1996, pp:65-74 [Conf]
   
7. Robert Muth, Udi Manber
   Approximate Multiple Strings Search. [Citation Graph (0, 0)][DBLP]
   CPM, 1996, pp:75-86 [Conf]
   
8. Chris Armen, Clifford Stein
   A 2 2/3-Approximation Algorithm for the Shortest Superstring Problem. [Citation Graph (0, 0)][DBLP]
   CPM, 1996, pp:87-101 [Conf]
   
9. Arne Andersson, N. Jesper Larsson, Kurt Swanson
   Suffix Trees on Words. [Citation Graph (0, 0)][DBLP]
   CPM, 1996, pp:102-115 [Conf]
   
10. Dany Breslauer
    The suffix Tree of a Tree and Minimizing Sequential Transducers. [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:116-129 [Conf]
    
11. Martin Farach, S. Muthukrishnan
    Perfect Hashing for Strings: Formalization and Algorithms. [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:130-140 [Conf]
    
12. Mikhail S. Gelfand, Andrey A. Mironov, Pavel A. Pevzner
    Spliced Alignment: A New Approach to Gene Recognition. [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:141-158 [Conf]
    
13. Vincent Ferretti, Joseph H. Nadeau, David Sankoff
    Original Synteny. [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:159-167 [Conf]
    
14. Piotr Berman, Sridhar Hannenhalli
    Fast Sorting by Reversal. [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:168-185 [Conf]
    
15. Marie-France Sagot, Alain Viari
    A Double Combinatorial Approach to Discovering Patterns in Biological Sequences. [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:186-208 [Conf]
    
16. Richard Arratia, Gesine Reinert
    Poisson Process Approximation for Repeats in One Sequence and Its Application to Sequencing by Hybridization. [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:209-219 [Conf]
    
17. Lusheng Wang, Dan Gusfield
    Improved Approximation Algorithms for Tree Alignment. [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:220-233 [Conf]
    
18. Cynthia A. Phillips, Tandy Warnow
    The Asymmetric Median Tree - A New model for Building Consensus Trees. [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:234-252 [Conf]
    
19. Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Gregory B. Sorkin
    Constructing Computer Virus Phylogenies. [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:253-270 [Conf]
    
20. Bilha Sandak, Ruth Nussinov, Haim J. Wolfson
    Docking of Conformationally Flexible Proteins. [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:271-287 [Conf]
    
21. William E. Hart, Sorin Istrail
    Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:288-303 [Conf]
    
22. Dan Gusfield, Richard M. Karp, Lusheng Wang, Paul Stelling
    Graph Traversals, Genes, and Matroids: An Efficient Case of the Travelling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:304-319 [Conf]
    
23. Amihood Amir, Gruia Calinescu
    Alphabet Independent and Dictionary Scaled Matching. [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:320-334 [Conf]
    
24. Kunsoo Park
    Analysis of Two-Dimensional Approximate Pattern Matching Algorithms. [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:335-347 [Conf]
    
25. Srinivasa Rao Arikati, Anders Dessmark, Andrzej Lingas, Madhav V. Marathe
    Approximation Algorithms for Maximum Two-Dimensional Pattern Matching. [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:348-360 [Conf]
    
26. Kaizhong Zhang
    Efficient Parallel Algorithms for Tree Editing Problems. [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:361-372 [Conf]
    
27. James J. Fu
    Approximate Pattern Matching in Directed Graphs. [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:373-383 [Conf]
    
28. Hans L. Bodlaender, Michael R. Fellows, Patricia A. Evans
    Finite-State Computability of Annotations of Strings and Trees. [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:384-391 [Conf]