Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2005 - Combinatorial analysis |
From inside the book
Results 1-3 of 52
Page 418
... points . Further- more , based on this labeling , a filtering operation can be applied to the spin images to eliminate redundant information . Collections of matched points are obtained from individual good matches if some geometric ...
... points . Further- more , based on this labeling , a filtering operation can be applied to the spin images to eliminate redundant information . Collections of matched points are obtained from individual good matches if some geometric ...
Page 421
... points based on the correlation of their spin images is O ( st ) , where s and t are the number of points that describe the two protein surfaces , respectively . This product is usually very large even for small protein sizes . For ...
... points based on the correlation of their spin images is O ( st ) , where s and t are the number of points that describe the two protein surfaces , respectively . This product is usually very large even for small protein sizes . For ...
Page 425
... points of the two cells , as follows . First , the spin - images are generated for all points in the two cells ; then for each pair of points , one one in each cell , if their associated spin images have the same label their correlation ...
... points of the two cells , as follows . First , the spin - images are generated for all points in the two cells ; then for each pair of points , one one in each cell , if their associated spin images have the same label their correlation ...
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