Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2005 - Combinatorial analysis |
From inside the book
Results 1-3 of 78
Page 184
... consider a new set of sequence modifications , that involve recombination or shuffling of segments of genome . The distance we define takes into account such kind of modifications and therefore it can be successfully applied to compare ...
... consider a new set of sequence modifications , that involve recombination or shuffling of segments of genome . The distance we define takes into account such kind of modifications and therefore it can be successfully applied to compare ...
Page 376
... consider the table such that each coordinate value is O ( n ) because each tree of size O ( n ) can correspond to some element in that table . Therefore , we can find the feature vector fK ( T ) closest to v in polynomial time by ...
... consider the table such that each coordinate value is O ( n ) because each tree of size O ( n ) can correspond to some element in that table . Therefore , we can find the feature vector fK ( T ) closest to v in polynomial time by ...
Page 377
... consider the case of adding a new vertex at depth d = d ( T ) to a tree T of size n ( see Fig . 2 ) . For each ( v , e , d ) such that D ( v , e , d ) = 1 and Î ( v , e , d ) = n , we consider all ways of appending a new vertex w having ...
... consider the case of adding a new vertex at depth d = d ( T ) to a tree T of size n ( see Fig . 2 ) . For each ( v , e , d ) such that D ( v , e , d ) = 1 and Î ( v , e , d ) = n , we consider all ways of appending a new vertex w having ...
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