Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2005 - Combinatorial analysis |
From inside the book
Results 1-3 of 84
Page 145
... problem is to choose such a seed to optimize the filtration efficiency . Given a set of similarities ( alignments ) of interest , the goal is to find the best seed or family of seeds . The problem has been declined in several ...
... problem is to choose such a seed to optimize the filtration efficiency . Given a set of similarities ( alignments ) of interest , the goal is to find the best seed or family of seeds . The problem has been declined in several ...
Page 325
... problem when k = 2 is called the constrained pairwise sequence alignment ( CPSA ) problem [ 3 , 9 ] . Solutions for CPSA can be used to solve the CMSA problem . We can progressively align the sequences into a multiple alignment by using ...
... problem when k = 2 is called the constrained pairwise sequence alignment ( CPSA ) problem [ 3 , 9 ] . Solutions for CPSA can be used to solve the CMSA problem . We can progressively align the sequences into a multiple alignment by using ...
Page 373
... problem . Several related problems have been studied in theoretical computer science . As mentioned above , sequencing by hybridization and the shortest common su- perstring problem [ 14 ] are close to the pre - image problem for ...
... problem . Several related problems have been studied in theoretical computer science . As mentioned above , sequencing by hybridization and the shortest common su- perstring problem [ 14 ] are close to the pre - image problem for ...
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