Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2005 - Combinatorial analysis |
From inside the book
Results 1-3 of 68
Page 161
... Construction of WDWG The on - line construction algorithm of WDWG processes the letters of w from left to right . At each step of construction , a WDWG of the prefix of w that has been processed is created correctly . The main works of ...
... Construction of WDWG The on - line construction algorithm of WDWG processes the letters of w from left to right . At each step of construction , a WDWG of the prefix of w that has been processed is created correctly . The main works of ...
Page 177
... Construction . In A. Apostolico and Z. Galil , editors , Combinatorial Algorithms on Words , pp . 97-107 . Springer - Verlag , 1985 . 5. Farach , M. Optimal suffix tree construction with large alphabets . Proc . 38th IEEE Symposium on ...
... Construction . In A. Apostolico and Z. Galil , editors , Combinatorial Algorithms on Words , pp . 97-107 . Springer - Verlag , 1985 . 5. Farach , M. Optimal suffix tree construction with large alphabets . Proc . 38th IEEE Symposium on ...
Page 308
... construction that results in fewer states and transitions . One possibility is to use the Thompson construction [ 11 ] . Given a regular expression E for L , the Thompson construction shown in Fig . 1 takes O ( E ) time and the ...
... construction that results in fewer states and transitions . One possibility is to use the Thompson construction [ 11 ] . Given a regular expression E for L , the Thompson construction shown in Fig . 1 takes O ( E ) time and the ...
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