default search action
7th CPM 1996: Laguna Beach, California, USA
- Daniel S. Hirschberg, Eugene W. Myers:
Combinatorial Pattern Matching, 7th Annual Symposium, CPM 96, Laguna Beach, California, USA, June 10-12, 1996, Proceedings. Lecture Notes in Computer Science 1075, Springer 1996, ISBN 3-540-61258-0
Session 1
- Ricardo A. Baeza-Yates, Gonzalo Navarro:
A Faster Algorithm for Approximate String Matching. 1-23 - Nadia El-Mabrouk, Maxime Crochemore:
Boyer-Moore Strategy to Efficient Approximate String Matching. 24-38 - Leszek Gasieniec, Marek Karpinski, Wojciech Plandowski, Wojciech Rytter:
Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract). 39-49 - Erkki Sutinen, Jorma Tarhio:
Filtration with q-Samples in Approximate String Matching. 50-63
Invited Lecture
- David J. Lipman:
Computing Discoveries in Molecular Biology (Abstract). 64
Session 2
- Gerth Stølting Brodal, Leszek Gasieniec:
Approximate Dictionary Queries. 65-74 - Robert Muth, Udi Manber:
Approximate Multiple Strings Search. 75-86 - Chris Armen, Clifford Stein:
A 2 2/3-Approximation Algorithm for the Shortest Superstring Problem. 87-101
Session 3
- Arne Andersson, N. Jesper Larsson, Kurt Swanson:
Suffix Trees on Words. 102-115 - Dany Breslauer:
The suffix Tree of a Tree and Minimizing Sequential Transducers. 116-129 - Martin Farach, S. Muthukrishnan:
Perfect Hashing for Strings: Formalization and Algorithms. 130-140
Session 4
- Mikhail S. Gelfand, Andrey A. Mironov, Pavel A. Pevzner:
Spliced Alignment: A New Approach to Gene Recognition. 141-158 - Vincent Ferretti, Joseph H. Nadeau, David Sankoff:
Original Synteny. 159-167 - Piotr Berman, Sridhar Hannenhalli:
Fast Sorting by Reversal. 168-185 - Marie-France Sagot, Alain Viari:
A Double Combinatorial Approach to Discovering Patterns in Biological Sequences. 186-208
Invited Lecture
- Richard Arratia, Gesine Reinert:
Poisson Process Approximation for Repeats in One Sequence and Its Application to Sequencing by Hybridization. 209-219
Session 5
- Lusheng Wang, Dan Gusfield:
Improved Approximation Algorithms for Tree Alignment. 220-233 - Cynthia A. Phillips, Tandy J. Warnow:
The Asymmetric Median Tree - A New model for Building Consensus Trees. 234-252 - Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Gregory B. Sorkin:
Constructing Computer Virus Phylogenies. 253-270
Session 6
- Bilha Sandak, Ruth Nussinov, Haim J. Wolfson:
Docking of Conformationally Flexible Proteins. 271-287 - William E. Hart, Sorin Istrail:
Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms (Extended Abstract). 288-303 - Dan Gusfield, Richard M. Karp, Lusheng Wang, Paul Stelling:
Graph Traversals, Genes, and Matroids: An Efficient Case of the Travelling Salesman Problem. 304-319
Session 7
- Amihood Amir, Gruia Calinescu:
Alphabet Independent and Dictionary Scaled Matching. 320-334 - Kunsoo Park:
Analysis of Two-Dimensional Approximate Pattern Matching Algorithms. 335-347 - Srinivasa Rao Arikati, Anders Dessmark, Andrzej Lingas, Madhav V. Marathe:
Approximation Algorithms for Maximum Two-Dimensional Pattern Matching. 348-360
Session 8
- Kaizhong Zhang:
Efficient Parallel Algorithms for Tree Editing Problems. 361-372 - James Jianghai Fu:
Approximate Pattern Matching in Directed Graphs. 373-383 - Hans L. Bodlaender, Michael R. Fellows, Patricia A. Evans:
Finite-State Computability of Annotations of Strings and Trees. 384-391
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.