Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2005 - Combinatorial analysis |
From inside the book
Results 1-3 of 88
Page 30
... Patterns ) . Let P be a pattern of length m and let occ be the number of outputs . Let n be the cardinality of S. The problems k - ATI , k - ADI , and k - ADCI can be solved with an index of size O ( nlogn ) which is built in time O ( n ...
... Patterns ) . Let P be a pattern of length m and let occ be the number of outputs . Let n be the cardinality of S. The problems k - ATI , k - ADI , and k - ADCI can be solved with an index of size O ( nlogn ) which is built in time O ( n ...
Page 130
... pattern { a , b , c , d , e , f } appearing once as abcdef and once as bdacfe , then the maximal notation of this pattern is ( ( a , b , c , d ) — ( e – ƒ ) ) . There are two main reasons for obtaining the maximal notation : ( 1 ) ...
... pattern { a , b , c , d , e , f } appearing once as abcdef and once as bdacfe , then the maximal notation of this pattern is ( ( a , b , c , d ) — ( e – ƒ ) ) . There are two main reasons for obtaining the maximal notation : ( 1 ) ...
Page 169
... pattern in a set of patterns , P = { P1 , P2 , ... , Pq } . This problem was first solved by Aho and Corasick [ 2 ] by creating a finite state machine to match the patterns with the text in one pass . In other words , their method ...
... pattern in a set of patterns , P = { P1 , P2 , ... , Pq } . This problem was first solved by Aho and Corasick [ 2 ] by creating a finite state machine to match the patterns with the text in one pass . In other words , their method ...
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