Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2005 - Combinatorial analysis |
From inside the book
Results 1-3 of 81
Page 76
... contains all the indices j , such that t ; > 0-1 and B contains all the indices j , such that Ok - 1 < tj ≤ 0k for k < b . The end result is that we can associate each entry t ; in the text with m / b entries in the pattern , since j ...
... contains all the indices j , such that t ; > 0-1 and B contains all the indices j , such that Ok - 1 < tj ≤ 0k for k < b . The end result is that we can associate each entry t ; in the text with m / b entries in the pattern , since j ...
Page 196
... contains all the information that must be known to decode the CODE and BASES regions . For example , it contains : - The type of compression used for sequences of bases ( it is either Arithmetic - 2 Coding , CTW or None ) , on 2 bits ...
... contains all the information that must be known to decode the CODE and BASES regions . For example , it contains : - The type of compression used for sequences of bases ( it is either Arithmetic - 2 Coding , CTW or None ) , on 2 bits ...
Page 284
... contains P ( T1 , S [ i2 , i ] ) , then the procedure reports i and halts . Otherwise , the procedure proceeds to the next iteration . = Correctness . The condition XR ( j , i2 , i ) | S [ i2 , i ] in Lemma 2 ( 1 ) is equivalent to the ...
... contains P ( T1 , S [ i2 , i ] ) , then the procedure reports i and halts . Otherwise , the procedure proceeds to the next iteration . = Correctness . The condition XR ( j , i2 , i ) | S [ i2 , i ] in Lemma 2 ( 1 ) is equivalent to 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