Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2005 - Combinatorial analysis |
From inside the book
Results 1-3 of 85
Page 6
... examples give lower bounds on the approximation guar- antee . For small values of r , we are able to give lower bounds which almost match our upper bounds the from previous section . For general values of r , we show an example where ...
... examples give lower bounds on the approximation guar- antee . For small values of r , we are able to give lower bounds which almost match our upper bounds the from previous section . For general values of r , we show an example where ...
Page 137
... example in Figure 3 is shown in Figure 5 . We next describe a new algorithm called REPLACE that transform S to the minimal consensus PQ tree . The general idea is to replace every chain by a Q node where the children of the Q node are ...
... example in Figure 3 is shown in Figure 5 . We next describe a new algorithm called REPLACE that transform S to the minimal consensus PQ tree . The general idea is to replace every chain by a Q node where the children of the Q node are ...
Page 185
... example . Example 7. Let u = aabc and v = abbc . Although the two sequences are not conjugate , ( u , v ) = 0 since ( u , v ) = ( UV ) 4 . As common usage , we refer to d as a " distance " when in fact neither it has to obey the ...
... example . Example 7. Let u = aabc and v = abbc . Although the two sequences are not conjugate , ( u , v ) = 0 since ( u , v ) = ( UV ) 4 . As common usage , we refer to d as a " distance " when in fact neither it has to obey 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