CPM B

29 papers

YearTitle / Authors
1996A 2 2/3-Approximation Algorithm for the Shortest Superstring Problem.
Chris Armen, Clifford Stein
1996A Double Combinatorial Approach to Discovering Patterns in Biological Sequences.
Marie-France Sagot, Alain Viari
1996A Faster Algorithm for Approximate String Matching.
Ricardo A. Baeza-Yates, Gonzalo Navarro
1996Alphabet Independent and Dictionary Scaled Matching.
Amihood Amir, Gruia Calinescu
1996Analysis of Two-Dimensional Approximate Pattern Matching Algorithms.
Kunsoo Park
1996Approximate Dictionary Queries.
Gerth Stølting Brodal, Leszek Gasieniec
1996Approximate Multiple Strings Search.
Robert Muth, Udi Manber
1996Approximate Pattern Matching in Directed Graphs.
James Jianghai Fu
1996Approximation Algorithms for Maximum Two-Dimensional Pattern Matching.
Srinivasa Rao Arikati, Anders Dessmark, Andrzej Lingas, Madhav V. Marathe
1996Boyer-Moore Strategy to Efficient Approximate String Matching.
Nadia El-Mabrouk, Maxime Crochemore
1996Combinatorial Pattern Matching, 7th Annual Symposium, CPM 96, Laguna Beach, California, USA, June 10-12, 1996, Proceedings
Daniel S. Hirschberg, Eugene W. Myers
1996Computing Discoveries in Molecular Biology (Abstract).
David J. Lipman
1996Constructing Computer Virus Phylogenies.
Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Gregory B. Sorkin
1996Docking of Conformationally Flexible Proteins.
Bilha Sandak, Ruth Nussinov, Haim J. Wolfson
1996Efficient Parallel Algorithms for Tree Editing Problems.
Kaizhong Zhang
1996Fast Sorting by Reversal.
Piotr Berman, Sridhar Hannenhalli
1996Filtration with q-Samples in Approximate String Matching.
Erkki Sutinen, Jorma Tarhio
1996Finite-State Computability of Annotations of Strings and Trees.
Hans L. Bodlaender, Michael R. Fellows, Patricia A. Evans
1996Graph Traversals, Genes, and Matroids: An Efficient Case of the Travelling Salesman Problem.
Dan Gusfield, Richard M. Karp, Lusheng Wang, Paul Stelling
1996Improved Approximation Algorithms for Tree Alignment.
Lusheng Wang, Dan Gusfield
1996Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms (Extended Abstract).
William E. Hart, Sorin Istrail
1996Original Synteny.
Vincent Ferretti, Joseph H. Nadeau, David Sankoff
1996Perfect Hashing for Strings: Formalization and Algorithms.
Martin Farach, S. Muthukrishnan
1996Poisson Process Approximation for Repeats in One Sequence and Its Application to Sequencing by Hybridization.
Richard Arratia, Gesine Reinert
1996Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract).
Leszek Gasieniec, Marek Karpinski, Wojciech Plandowski, Wojciech Rytter
1996Spliced Alignment: A New Approach to Gene Recognition.
Mikhail S. Gelfand, Andrey A. Mironov, Pavel A. Pevzner
1996Suffix Trees on Words.
Arne Andersson, N. Jesper Larsson, Kurt Swanson
1996The Asymmetric Median Tree - A New model for Building Consensus Trees.
Cynthia A. Phillips, Tandy J. Warnow
1996The suffix Tree of a Tree and Minimizing Sequential Transducers.
Dany Breslauer