Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2005 - Combinatorial analysis |
From inside the book
Results 1-3 of 85
Page 72
... functions are orthonormal in the sense that Σ ±± 1 - ¿ hj ( x ) hê ( x ) = 0 when j ‡ k and Σx - 1-6 h2 ( x ) = 1. Consequently , any even function f ( x ) with period 28 can be written as c = 1-8 f ( x ) = Σаxhx ( x ) , where the ...
... functions are orthonormal in the sense that Σ ±± 1 - ¿ hj ( x ) hê ( x ) = 0 when j ‡ k and Σx - 1-6 h2 ( x ) = 1. Consequently , any even function f ( x ) with period 28 can be written as c = 1-8 f ( x ) = Σаxhx ( x ) , where the ...
Page 169
... function and the index structure of the reversed patterns , be it a suffix tree or an enhanced suffix array . This connection is ex- plained in detail in Section 3.2 . Our algorithm uses the new linear time algorithms to construct ...
... function and the index structure of the reversed patterns , be it a suffix tree or an enhanced suffix array . This connection is ex- plained in detail in Section 3.2 . Our algorithm uses the new linear time algorithms to construct ...
Page 175
... Annual Symposium. 3.4 Building the Output Function The Output function can be computed , just as in [ 2 ] , during the computation of the Goto and Failure functions , with a traversal on the trie . Gusfield refines these computations ...
... Annual Symposium. 3.4 Building the Output Function The Output function can be computed , just as in [ 2 ] , during the computation of the Goto and Failure functions , with a traversal on the trie . Gusfield refines these computations ...
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