Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2005 - Combinatorial analysis |
From inside the book
Results 1-3 of 87
Page 217
... Complexity Analysis of the DIST Prepend Opera- tion : Given string B of size O ( n ) , a character a , a discrete scoring table , and the linear encoding of DISTA ( HLIST col ) for a string A , the linear encoding of DISTA ( HLIST col ) ...
... Complexity Analysis of the DIST Prepend Opera- tion : Given string B of size O ( n ) , a character a , a discrete scoring table , and the linear encoding of DISTA ( HLIST col ) for a string A , the linear encoding of DISTA ( HLIST col ) ...
Page 236
... complexity is the size of the former for which Proposition 1 gave us an upper bound of O ( n gk ) . Time complexity in the worst case coincides with the cost of the overlapping phase . The repeat starting at line 10 is done O ( k / d ) ...
... complexity is the size of the former for which Proposition 1 gave us an upper bound of O ( n gk ) . Time complexity in the worst case coincides with the cost of the overlapping phase . The repeat starting at line 10 is done O ( k / d ) ...
Page 297
... complexity of string matching , Proc . 33rd IEEE Symp . Found . Comp . Sci . ( 1992 ) 600-609 . 4. Richard Cole , Ramesh Hariharan , Michael S. Paterson & Uri Zwick , Tighter lower bounds on the exact complexity of string matching ...
... complexity of string matching , Proc . 33rd IEEE Symp . Found . Comp . Sci . ( 1992 ) 600-609 . 4. Richard Cole , Ramesh Hariharan , Michael S. Paterson & Uri Zwick , Tighter lower bounds on the exact complexity of string 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