Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2005 - Combinatorial analysis |
From inside the book
Results 1-3 of 91
Page 267
... definition of function matching is asymmetric whereas the definition of parameterized matching is symmetric . The parameterized matching problem is defined as follows : Input : An n x n text T and an m × m pattern P. Output : All ...
... definition of function matching is asymmetric whereas the definition of parameterized matching is symmetric . The parameterized matching problem is defined as follows : Input : An n x n text T and an m × m pattern P. Output : All ...
Page 366
... define a neighborhood , we will use in this section the Hamming distance d . Definition 6. A neighborhood of H = ( Hi ) 1 is a set of words N such that HCN ( i.e. Hi C Ni for i = 1..m ) . The k - neighborhood ( relative to N ) B ( H ) ...
... define a neighborhood , we will use in this section the Hamming distance d . Definition 6. A neighborhood of H = ( Hi ) 1 is a set of words N such that HCN ( i.e. Hi C Ni for i = 1..m ) . The k - neighborhood ( relative to N ) B ( H ) ...
Page 374
... definition . Since most papers on marginalized graph kernels [ 8 , 11 , 16 ] use this notation , we employ this definition of a path . Let ≤ be the set of label sequences ( i.e. , the set of strings ) over Σ whose lengths are between 1 ...
... definition . Since most papers on marginalized graph kernels [ 8 , 11 , 16 ] use this notation , we employ this definition of a path . Let ≤ be the set of label sequences ( i.e. , the set of strings ) over Σ whose lengths are between 1 ...
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