Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2005 - Combinatorial analysis |
From inside the book
Results 1-3 of 67
Page 11
... common subsequence problem ( LCS ) and the closest substring problem ( CSP ) are two models for the finding of com- mon patterns in strings . The two problem have been studied extensively . The former was previously proved to be not ...
... common subsequence problem ( LCS ) and the closest substring problem ( CSP ) are two models for the finding of com- mon patterns in strings . The two problem have been studied extensively . The former was previously proved to be not ...
Page 12
... common substring problem to be hard problems , respectively . In this paper , we study another generalization of the longest common sub- string problem . We call the new problem longest common rigid subsequence ( LCRS ) and it is useful ...
... common substring problem to be hard problems , respectively . In this paper , we study another generalization of the longest common sub- string problem . We call the new problem longest common rigid subsequence ( LCRS ) and it is useful ...
Page 136
... common intervals that are necessary for constructing T is the set of irreducible intervals as defined in [ 14 ] : Given II , without loss of generality , we assume that 1 = id2 = ( 1,2 , ... , n ) . : = Two common intervals c1 , c2 € Сп ...
... common intervals that are necessary for constructing T is the set of irreducible intervals as defined in [ 14 ] : Given II , without loss of generality , we assume that 1 = id2 = ( 1,2 , ... , n ) . : = Two common intervals c1 , c2 € Сп ...
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