Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2005 - Combinatorial analysis |
From inside the book
Results 1-3 of 90
Page 58
... algorithm followed the odd - even scheme ( i.e. , -recursion ) , which was used in Farach's algorithm [ 3 , 4 ] and Kim et al.'s algorithm [ 13 ] . In this paper we give another algorithm for constructing the index data structures in o ...
... algorithm followed the odd - even scheme ( i.e. , -recursion ) , which was used in Farach's algorithm [ 3 , 4 ] and Kim et al.'s algorithm [ 13 ] . In this paper we give another algorithm for constructing the index data structures in o ...
Page 80
... algorithm . Two algorithms that are the most relevant to ours are those proposed by Tarhio and Ukkonen [ 9 ] and by Baeza - Yates and Gonnet [ 2 ] . Both can be considered as generalizations of the Boyer - Moore algorithm [ 3 ] for ...
... algorithm . Two algorithms that are the most relevant to ours are those proposed by Tarhio and Ukkonen [ 9 ] and by Baeza - Yates and Gonnet [ 2 ] . Both can be considered as generalizations of the Boyer - Moore algorithm [ 3 ] for ...
Page 93
... algorithm . We conclude with a short discussion and open problems . 2 Matching Algorithms for the L1 , L2 and Lo . Metrics 2.1 An L1 Matching Algorithm We present here an O ( n√m log m ) -time algorithm that solves the L1 Matching ...
... algorithm . We conclude with a short discussion and open problems . 2 Matching Algorithms for the L1 , L2 and Lo . Metrics 2.1 An L1 Matching Algorithm We present here an O ( n√m log m ) -time algorithm that solves the L1 Matching ...
Contents
Sharper Upper and Lower Bounds for an Approximation Scheme | 1 |
Text Indexing with Errors | 21 |
Succinct Suffix Arrays Based on RunLength Encoding | 45 |
Copyright | |
20 other sections not shown
Other editions - View all
Common terms and phrases
algorithm alignment alphabet Apostolico approximate automaton Bioinformatics bits bound breakpoint Burrows-Wheeler transform c-token character column complexity Computer Science consensus PQ tree consider constraints construction Corasick corresponding Crochemore data structure defined Definition denote DFTDP DIST DNA sequences dynamic programming edges edit distance efficient encoding errors example exons function gene genome given graph Hamming distance implementation input integer interval label Lemma length linear LNCS mass matching problem Max-SNP maximal median minimal consensus PQ mismatches motif multiset node O(n log obtained occurrences optimal output p₁ pair Parsing path pattern matching peak permutations polynomial position PQ tree prefix prefix-free preprocessing Proc Proof protein regular expression rigid subsequence S₁ score Section shift distance space spin images Springer-Verlag string matching substring suffix array suffix tree term tree Theorem trie variable vector vertex WDWG words