default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID5th CPM 1994: Asilomar, California, USA
- Maxime Crochemore, Dan Gusfield:
Combinatorial Pattern Matching, 5th Annual Symposium, CPM 94, Asilomar, California, USA, June 5-8, 1994, Proceedings. Lecture Notes in Computer Science 807, Springer 1994, ISBN 3-540-58094-8
Alignments
- Gary Benson:
A Space Efficient Algorithm for Finding the Best Non-Overlapping Alignment Score. 1-14 - Hans L. Bodlaender
, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham:
The Parameterized Complexity of Sequence Alignment and Consensus. 15-30 - Kun-Mao Chao:
Computing all Suboptimal Alignments in Linear Space. 31-42 - Vineet Bafna, Eugene L. Lawler, Pavel A. Pevzner:
Approximation Algorithms for Multiple Sequence Alignment. 43-53 - Xiaoqiu Huang:
A Context Dependent Method for Comparing Sequences. 54-63 - Archie L. Cobbs:
Fast Identification of Approximately Matching Substrings. 64-74 - Tao Jiang, Lusheng Wang, Kaizhong Zhang:
Alignment of Trees - An Alternative to Tree Edit. 75-86
Various Matchings
- Xiaoqiu Huang, Pavel A. Pevzner, Webb Miller:
Parametric Recomuting in Alignment Graphs. 87-101 - Tomasz Luczak, Wojciech Szpankowski:
A Lossy Data Compression Based on String Matching: Preliminary Analysis and Suboptimal Algorithms. 102-112 - Udi Manber:
A Text Compression Scheme That Allows Fast Searching Directly in the Compressed File. 113-124 - Marek Karpinski, Wojciech Rytter:
An Alphabet-Independent Optimal Parallel Search for Three Dimensional Pattern. 125-135 - L. Lestrée:
Unit Route Upper Bound for String-Matching on Hypercube. 136-145
Combinatorial Aspects
- S. Rao Kosaraju:
Computation of Squares in a String (Preliminary Version). 146-150 - Mehryar Mohri:
Minimization of Sequential Transducers. 151-163 - Kenneth S. Alexander:
Shortest Common Superstrings for Strings of Random Letters. 164-172 - Robert W. Irving, Campbell Fraser:
Maximal Common Subsequences and Minimal Common Supersequences. 173-183 - Dany Breslauer:
Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries. 184-197 - Ricardo A. Baeza-Yates, Walter Cunto, Udi Manber, Sun Wu:
Proximity Matching Using Fixed-Queries Trees. 198-212 - Pekka Kilpeläinen, Heikki Mannila:
Query Primitives for Tree-Structured Data. 213-225
More Bio-Informatics
- Ramana M. Idury, Alejandro A. Schäffer:
Multiple Matching of Parameterized Patterns. 226-239 - Tatsuya Akutsu:
Approximate String Matching with Don't Care Characters. 240-249 - Shouwen Tang, Kaizhong Zhang, Xiaolin Wu:
Matching with Matrix Norm Minimization. 250-258 - William I. Chang, Thomas G. Marr:
Approximate String Matching and Local Similarity. 259-273 - Minoru Ito, Kuniyasu Shimizu, Michio Nakanishi, Akihiro Hashimoto:
Polynomial-Time Algorithms for Computing Characteristic Strings. 274-288 - 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. 289-306 - John D. Kececioglu, David Sankoff:
Efficient Bounds for Oriented Chromosome Inversion Distance. 307-325
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.
last updated on 2025-02-24 21:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
