Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2005 - Combinatorial analysis |
From inside the book
Results 1-3 of 27
Page 100
... blocks , each of size between 2√k log m and 4√k log m , such that all occurrences of every symbol appear in a ... blocks two convolutions . These convolu- tions compute the L1 distance of the elements of the block with all text ...
... blocks , each of size between 2√k log m and 4√k log m , such that all occurrences of every symbol appear in a ... blocks two convolutions . These convolu- tions compute the L1 distance of the elements of the block with all text ...
Page 188
... blocks of size M. A single block is read , compressed and written to the output file before the next one is considered ( cf. [ 13 ] and references therein ) . In this section we use the notion of simultaneous compression in order to ...
... blocks of size M. A single block is read , compressed and written to the output file before the next one is considered ( cf. [ 13 ] and references therein ) . In this section we use the notion of simultaneous compression in order to ...
Page 204
... blocks , and mask out the global information which varies for each considered chain in which the blocks are embedded . 3. In order to achieve direction flexibility in the alignment computation , a new key operation is introduced in this ...
... blocks , and mask out the global information which varies for each considered chain in which the blocks are embedded . 3. In order to achieve direction flexibility in the alignment computation , a new key operation is introduced in this ...
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