Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2005 - Combinatorial analysis |
From inside the book
Results 1-3 of 89
Page 168
... alphabets . Processing a text of size m over an alphabet with the automaton costs O ( m log | Σ | + k ) , where there are k occurrences of patterns in the text . Introduction The exact set matching problem [ 7 ] is defined as finding ...
... alphabets . Processing a text of size m over an alphabet with the automaton costs O ( m log | Σ | + k ) , where there are k occurrences of patterns in the text . Introduction The exact set matching problem [ 7 ] is defined as finding ...
Page 230
... alphabet . In this section we formalize the way we express the approximation , and the motifs we want to infer according to this . Let the input text be a sequence t over the alphabet E. We assume that it has length n and we denote this ...
... alphabet . In this section we formalize the way we express the approximation , and the motifs we want to infer according to this . Let the input text be a sequence t over the alphabet E. We assume that it has length n and we denote this ...
Page 266
... alphabet of S to the alphabet of S ' such that S ' [ i ] = π ( S [ i ] ) for every index i . In the parameterized matching problem , introduced by Baker [ 9 , 11 ] , one is given a text T and pattern P and the goal is to find all the ...
... alphabet of S to the alphabet of S ' such that S ' [ i ] = π ( S [ i ] ) for every index i . In the parameterized matching problem , introduced by Baker [ 9 , 11 ] , one is given a text T and pattern P and the goal is to find all 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