Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2005 - Combinatorial analysis |
From inside the book
Results 1-3 of 82
Page 28
... Structure Size and Preprocessing Time ) . Let n be the number of strings in S , and let h = maxo≤i≤k hi . Then , for constant k , the total size of the data structures is O ( nh * ) and the preprocessing time is O ( nhk + 1 ) . Proof ...
... Structure Size and Preprocessing Time ) . Let n be the number of strings in S , and let h = maxo≤i≤k hi . Then , for constant k , the total size of the data structures is O ( nh * ) and the preprocessing time is O ( nhk + 1 ) . Proof ...
Page 34
... structures under the name of FM - index . Sadakane [ 30 ] modified the compressed suffix array so that it acts as a self - indexing data structure . The compressed suffix array and the FM - index can be further compressed by using high ...
... structures under the name of FM - index . Sadakane [ 30 ] modified the compressed suffix array so that it acts as a self - indexing data structure . The compressed suffix array and the FM - index can be further compressed by using high ...
Page 427
... structure . In Structural Bioinformatics , ( Bourne P.E. and Weissig H. eds ) , Wiley- Liss . 2. Chua C. , Jarvis R. ( 1996 ) 3D free form surface registration and object recognition , Int . Journal of Computer Vision , 17 , 77-99 . 3 ...
... structure . In Structural Bioinformatics , ( Bourne P.E. and Weissig H. eds ) , Wiley- Liss . 2. Chua C. , Jarvis R. ( 1996 ) 3D free form surface registration and object recognition , Int . Journal of Computer Vision , 17 , 77-99 . 3 ...
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