default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID13th CPM 2002: Fukuoka, Japan
- Alberto Apostolico, Masayuki Takeda:
Combinatorial Pattern Matching, 13th Annual Symposium, CPM 2002, Fukuoka, Japan, July 3-5, 2002, Proceedings. Lecture Notes in Computer Science 2373, Springer 2002, ISBN 3-540-43862-9 - Jun Ogasawara, Shinichi Morishita
:
Practical Software for Aligning ESTs to Human Genome. 1-16 - Hiroki Arimura:
Efficient Text Mining with Optimized Pattern Discovery. 17-19 - Wojciech Rytter:
Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression. 20-31 - Raymond Wan, Alistair Moffat:
Block Merging for Off-Line Compression. 32-41 - Jussi Rautio, Jani Tanninen, Jorma Tarhio:
String Matching with Stopper Encoding and Code Splitting. 42-52 - Stéphane Vialette:
Pattern Matching Problems over 2-Interval Sets. 53-63 - Venkatesan T. Chakaravarthy, Rajasekar Krishnamurthy:
The Problem of Context Sensitive String Matching. 64-75 - Frantisek Franek, Jiandong Jiang, Weilin Lu, William F. Smyth:
Two-Pattern Strings. 76-84 - Dana Shapira, James A. Storer:
Edit Distance with Move Operations. 85-98 - Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier:
Towards Optimally Solving the LONGEST COMMON SUBSEQUENCE Problem for Sequences with Nested Arc Annotations in Linear Time. 99-114 - Veli Mäkinen, Esko Ukkonen:
Local Similarity Based Point-Pattern Matching. 115-132 - Costas S. Iliopoulos, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas:
Identifying Occurrences of Maximal Pairs in Multiple Strings. 133-143 - Wing-Kai Hon, Kunihiko Sadakane:
Space-Economical Algorithms for Finding Maximal Unique Matches. 144-152 - Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara, Hiromasa Hoshino, Setsuo Arikawa:
The Minimum DAWG for All Suffixes of a String and Its Applications. 153-167 - Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott:
On the Complexity of Deriving Position Specific Score Matrices from Examples. 168-177 - Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter:
Three Heuristics for delta-Matching: delta-BM Algorithms. 178-189 - Brona Brejová, Tomás Vinar:
A Better Method for Length Distribution Modeling in HMMs and Its Application to Gene Finding. 190-202 - Heikki Hyyrö, Gonzalo Navarro:
Faster Bit-Parallel Approximate String Matching. 203-224 - Stefan Burkhardt, Juha Kärkkäinen:
One-Gapped q-Gram Filtersfor Levenshtein Distance. 225-234 - Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen:
Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations. 235-248 - Süleyman Cenk Sahinalp, Evan E. Eichler, Paul W. Goldberg, Petra Berenbrink, Tom Friedetzky, Funda Ergün:
Statistical Identification of Uniformly Mutated Segments within Repeats. 249-261 - S. Muthukrishnan, Süleyman Cenk Sahinalp:
Simple and Practical Sequence Nearest Neighbors with Block Operations. 262-278 - Lucian Ilie, Sheng Yu:
Constructing NFA s by Optimal Use of Positions in Regular Expressions. 279-288
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-01-03 23:16 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:
