Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2005 - Combinatorial analysis |
From inside the book
Results 1-3 of 25
Page 230
... relations allow one to constraint the motifs so that more specific prop- erties are satisfied and thus a more sensitive tool can be conceived . The inference of motifs with relations can find application in many tasks . We will focus ...
... relations allow one to constraint the motifs so that more specific prop- erties are satisfied and thus a more sensitive tool can be conceived . The inference of motifs with relations can find application in many tasks . We will focus ...
Page 237
... relations alphabet and r € Ra relation . Let GR { CR1 , ... , CRGRI } with CRi C R for 1 ≤ i ≤ GR be a relations cover on R where the CR's are denoted as relations groups and none of them is included into another . Similarly to the ...
... relations alphabet and r € Ra relation . Let GR { CR1 , ... , CRGRI } with CRi C R for 1 ≤ i ≤ GR be a relations cover on R where the CR's are denoted as relations groups and none of them is included into another . Similarly to the ...
Page 239
... relations tests is negligible , the time complexity of KMRoverlapR can be computed as in Section 4 and therefore it is in O ( kn ( g + g ) 2 ) . Notice that in KMRoverlapR the input size is no longer n but rather n k because only relations ...
... relations tests is negligible , the time complexity of KMRoverlapR can be computed as in Section 4 and therefore it is in O ( kn ( g + g ) 2 ) . Notice that in KMRoverlapR the input size is no longer n but rather n k because only relations ...
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