Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2005 - Combinatorial analysis |
From inside the book
Results 1-3 of 35
Page 168
... automaton for a set of patterns , P , of total length n , in O ( n ) time and space for integer alphabets . Processing a text of size m over an alphabet with the automaton costs O ( m log | Σ | + k ) , where there are k occurrences of ...
... automaton for a set of patterns , P , of total length n , in O ( n ) time and space for integer alphabets . Processing a text of size m over an alphabet with the automaton costs O ( m log | Σ | + k ) , where there are k occurrences of ...
Page 328
... automaton in part ( b ) for the finite automaton N shown in part ( a ) that is equivalent to regular expression R = A ( C + G ) * ( S + T ) . For clarity , we choose as an example a simple regular expression , and we do not show the ...
... automaton in part ( b ) for the finite automaton N shown in part ( a ) that is equivalent to regular expression R = A ( C + G ) * ( S + T ) . For clarity , we choose as an example a simple regular expression , and we do not show the ...
Page 329
... automaton N equivalent to R = A ( C + G ) * ( S + T ) . ( b ) Weighted Nx N automaton M. We will use multiple copies of the same weighted N x N automaton M. The weights will be updated as the alignment computations progress . At any ...
... automaton N equivalent to R = A ( C + G ) * ( S + T ) . ( b ) Weighted Nx N automaton M. We will use multiple copies of the same weighted N x N automaton M. The weights will be updated as the alignment computations progress . At any ...
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