Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2005 - Combinatorial analysis |
From inside the book
Results 1-3 of 31
Page 210
... weight such forest would therefore yield a solution to the " Append - Prepend Parsing " optimization problem . In order to apply known RSMA algorithms to the computation of such a minimum - weight forest in G we need to further adapt ...
... weight such forest would therefore yield a solution to the " Append - Prepend Parsing " optimization problem . In order to apply known RSMA algorithms to the computation of such a minimum - weight forest in G we need to further adapt ...
Page 328
... weights of the active states are updated using the weight y ( x y ) of the edit operation x ā y , and the ā weights of the states through which new states are reached . - Step 2. For all ( p , q ) , if there does not exist ( p ' , q ...
... weights of the active states are updated using the weight y ( x y ) of the edit operation x ā y , and the ā weights of the states through which new states are reached . - Step 2. For all ( p , q ) , if there does not exist ( p ' , q ...
Page 386
... weight c or more is called a c - token if all its proper suffixes have weight strictly less than c . Clearly , it suffices to enforce constraint ( C ) for all c - tokens x . Let N denote the number of c - tokens , and { C1 , ... , CN } ...
... weight c or more is called a c - token if all its proper suffixes have weight strictly less than c . Clearly , it suffices to enforce constraint ( C ) for all c - tokens x . Let N denote the number of c - tokens , and { C1 , ... , CN } ...
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