Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2005 - Combinatorial analysis |
From inside the book
Results 1-3 of 44
Page 75
... solved . Locations that are in the intersec- tion Is will meet both the d - matching and y - matching criteria since total differences are correctly calculated for all locations in Is . The final algorithm requires 48 - 1 inner ...
... solved . Locations that are in the intersec- tion Is will meet both the d - matching and y - matching criteria since total differences are correctly calculated for all locations in Is . The final algorithm requires 48 - 1 inner ...
Page 308
... solved in O ( mn2 ) time using O ( m ) space based on the algorithm of Crochemore and Hancart [ 5 ] . Whereas , we observed that the infix - free regular - expression matching problem can be solved in O ( mn ) time using O ( m ) space ...
... solved in O ( mn2 ) time using O ( m ) space based on the algorithm of Crochemore and Hancart [ 5 ] . Whereas , we observed that the infix - free regular - expression matching problem can be solved in O ( mn ) time using O ( m ) space ...
Page 375
... solved in O ( n ) time . For the SISF - M problem , we may construct graph G ' ( V , E ) in the same way . But , G ' ( V , E ) does not necessarily have an Eulerian path . Thus , we should add or delete edges ( using the minimum number ...
... solved in O ( n ) time . For the SISF - M problem , we may construct graph G ' ( V , E ) in the same way . But , G ' ( V , E ) does not necessarily have an Eulerian path . Thus , we should add or delete edges ( using the minimum number ...
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