Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2005 - Combinatorial analysis |
From inside the book
Results 1-3 of 79
Page 173
... corresponding nodes in TR . Then u2 = PA ( u1 ) . Our algorithm is based on this property . Now that we've found this information in TR , we would like to relay it to the nodes in the trie . Each node in the trie must be connected to ...
... corresponding nodes in TR . Then u2 = PA ( u1 ) . Our algorithm is based on this property . Now that we've found this information in TR , we would like to relay it to the nodes in the trie . Each node in the trie must be connected to ...
Page 174
... corresponding to each character . ( b ) ( Sp ) and corresponding indices in Sp . ( c ) TR nodes and the indices in Sp corresponding to their labels . The first index is always a $ , and the last index ( in bold ) is the relevant one . A ...
... corresponding to each character . ( b ) ( Sp ) and corresponding indices in Sp . ( c ) TR nodes and the indices in Sp corresponding to their labels . The first index is always a $ , and the last index ( in bold ) is the relevant one . A ...
Page 387
... corresponding vertex or arc is visited by an s - t path corresponding to a selected tag . Let in ( v ) and out ( v ) denote the set of arcs entering , respectively leaving vertex v . The integer program can then be written as follows ...
... corresponding vertex or arc is visited by an s - t path corresponding to a selected tag . Let in ( v ) and out ( v ) denote the set of arcs entering , respectively leaving vertex v . The integer program can then be written as follows ...
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