Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2005 - Combinatorial analysis |
From inside the book
Results 1-3 of 43
Page 219
... Motif discovery is the problem of finding local patterns or motifs from a set of unlabeled sequences . One common representation of a motif is a Markov model known as a score matrix . Matrix based motif discovery has been extensively ...
... Motif discovery is the problem of finding local patterns or motifs from a set of unlabeled sequences . One common representation of a motif is a Markov model known as a score matrix . Matrix based motif discovery has been extensively ...
Page 220
... Motif Discovery and Consistent Permutations Motif discovery is the task of finding meaningful motif instances of some motif ( i.e. pattern ) from longer unlabeled sequences . When applied to analyzing ge- nomic sequences , this is ...
... Motif Discovery and Consistent Permutations Motif discovery is the task of finding meaningful motif instances of some motif ( i.e. pattern ) from longer unlabeled sequences . When applied to analyzing ge- nomic sequences , this is ...
Page 231
... motif of t is a k - pattern that occurs in t at least q times . The number q is named quorum . When unnecessary or clear from the context , we will omit the k and simply talk about pattern and motif . Definition 4. A k - motif I of t is ...
... motif of t is a k - pattern that occurs in t at least q times . The number q is named quorum . When unnecessary or clear from the context , we will omit the k and simply talk about pattern and motif . Definition 4. A k - motif I of t is ...
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