CPM B

24 papers

YearTitle / Authors
2002A Better Method for Length Distribution Modeling in HMMs and Its Application to Gene Finding.
Brona Brejová, Tomás Vinar
2002Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression.
Wojciech Rytter
2002Block Merging for Off-Line Compression.
Raymond Wan, Alistair Moffat
2002Combinatorial Pattern Matching, 13th Annual Symposium, CPM 2002, Fukuoka, Japan, July 3-5, 2002, Proceedings
Alberto Apostolico, Masayuki Takeda
2002Constructing NFA s by Optimal Use of Positions in Regular Expressions.
Lucian Ilie, Sheng Yu
2002Edit Distance with Move Operations.
Dana Shapira, James A. Storer
2002Efficient Text Mining with Optimized Pattern Discovery.
Hiroki Arimura
2002Faster Bit-Parallel Approximate String Matching.
Heikki Hyyrö, Gonzalo Navarro
2002Identifying Occurrences of Maximal Pairs in Multiple Strings.
Costas S. Iliopoulos, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas
2002Local Similarity Based Point-Pattern Matching.
Veli Mäkinen, Esko Ukkonen
2002On the Complexity of Deriving Position Specific Score Matrices from Examples.
Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott
2002One-Gapped q-Gram Filtersfor Levenshtein Distance.
Stefan Burkhardt, Juha Kärkkäinen
2002Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations.
Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen
2002Pattern Matching Problems over 2-Interval Sets.
Stéphane Vialette
2002Practical Software for Aligning ESTs to Human Genome.
Jun Ogasawara, Shinichi Morishita
2002Simple and Practical Sequence Nearest Neighbors with Block Operations.
S. Muthukrishnan, Süleyman Cenk Sahinalp
2002Space-Economical Algorithms for Finding Maximal Unique Matches.
Wing-Kai Hon, Kunihiko Sadakane
2002Statistical Identification of Uniformly Mutated Segments within Repeats.
Süleyman Cenk Sahinalp, Evan E. Eichler, Paul W. Goldberg, Petra Berenbrink, Tom Friedetzky, Funda Ergün
2002String Matching with Stopper Encoding and Code Splitting.
Jussi Rautio, Jani Tanninen, Jorma Tarhio
2002The Minimum DAWG for All Suffixes of a String and Its Applications.
Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara, Hiromasa Hoshino, Setsuo Arikawa
2002The Problem of Context Sensitive String Matching.
Venkatesan T. Chakaravarthy, Rajasekar Krishnamurthy
2002Three Heuristics for delta-Matching: delta-BM Algorithms.
Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
2002Towards Optimally Solving the LONGEST COMMON SUBSEQUENCE Problem for Sequences with Nested Arc Annotations in Linear Time.
Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier
2002Two-Pattern Strings.
Frantisek Franek, Jiandong Jiang, Weilin Lu, William F. Smyth