Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2005 - Combinatorial analysis |
From inside the book
Results 1-3 of 50
Page 148
... Instance : A finite subset G C Z , two non - negative integers N and q . Question : Does it exist a subset TCZ of cardinality q such that G + T contains at least N consecutive integers ? It is related to tiling problems . We assume that ...
... Instance : A finite subset G C Z , two non - negative integers N and q . Question : Does it exist a subset TCZ of cardinality q such that G + T contains at least N consecutive integers ? It is related to tiling problems . We assume that ...
Page 149
... instance of SSC . It remains to show that whenever ( G , N , q ) is a positive instance of SSC , ( V , E ) is a positive instance of X3C . For this , we need the following lemma . Lemma 12 . Vt EZ ( i , j ) = [ 1 , m ] × [ 1 , q ] ( G + ...
... instance of SSC . It remains to show that whenever ( G , N , q ) is a positive instance of SSC , ( V , E ) is a positive instance of X3C . For this , we need the following lemma . Lemma 12 . Vt EZ ( i , j ) = [ 1 , m ] × [ 1 , q ] ( G + ...
Page 151
... instance ( g , m , k ) of NON DETECTION , an ( m , k ) -similarity not detected by g is a polynomial certificate for NON DETECTION on ( g , m , k ) . Hence , to obtain the NP - completeness of NON DETECTION , it suffices to reduce SSC ...
... instance ( g , m , k ) of NON DETECTION , an ( m , k ) -similarity not detected by g is a polynomial certificate for NON DETECTION on ( g , m , k ) . Hence , to obtain the NP - completeness of NON DETECTION , it suffices to reduce SSC ...
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