Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2005 - Combinatorial analysis |
From inside the book
Results 1-3 of 64
Page 6
... inputs . Proof . We set L = n . The input will be the n x n identity matrix In , with ones on the diagonal and zeroes everywhere else . The cost of the optimal solution is n . The result of the PTAS for r = 1 will be one of the matrix ...
... inputs . Proof . We set L = n . The input will be the n x n identity matrix In , with ones on the diagonal and zeroes everywhere else . The cost of the optimal solution is n . The result of the PTAS for r = 1 will be one of the matrix ...
Page 9
... input sequences , computes the consensus sequence of the substrings , and then finds the best matches to this consensus in all strings . After examining all pos- sible choices , it chooses as the motif the consensus substring chosen ...
... input sequences , computes the consensus sequence of the substrings , and then finds the best matches to this consensus in all strings . After examining all pos- sible choices , it chooses as the motif the consensus substring chosen ...
Page 230
... input text that is a sequence over an alphabet . In this section we formalize the way we express the approximation , and the motifs we want to infer according to this . Let the input text be a sequence t over the alphabet E. We assume ...
... input text that is a sequence over an alphabet . In this section we formalize the way we express the approximation , and the motifs we want to infer according to this . Let the input text be a sequence t over the alphabet E. We assume ...
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