Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2005 - Combinatorial analysis |
From inside the book
Results 1-3 of 81
Page 87
... characters , where k 3. ( b ) The expected total number of character comparisons under different numbers of matches in the last k + characters , where = 3 k Total character comparisons . The total number of character comparisons made in ...
... characters , where k 3. ( b ) The expected total number of character comparisons under different numbers of matches in the last k + characters , where = 3 k Total character comparisons . The total number of character comparisons made in ...
Page 88
... characters as a match if they share a com- mon non - degenerate character , e.g. , R and H is a match when aligning them . When calculating shift distances , FAAST treats a degenerate character as any of its corresponding non ...
... characters as a match if they share a com- mon non - degenerate character , e.g. , R and H is a match when aligning them . When calculating shift distances , FAAST treats a degenerate character as any of its corresponding non ...
Page 222
... characters appearing in column d of P. C1d is the consensus character for column d and has the highest possible score of any character in column d . From these definitions , given po we know the rank of Cid , C2d , ... Ckd , in column d ...
... characters appearing in column d of P. C1d is the consensus character for column d and has the highest possible score of any character in column d . From these definitions , given po we know the rank of Cid , C2d , ... Ckd , in column d ...
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