Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2005 - Combinatorial analysis |
From inside the book
Results 1-3 of 87
Page 34
... efficient one . Compressed suffix arrays and compressed suf- fix trees are space efficient full - text index data structures that consume O ( n log ) bits . Munro et al . [ 28 ] developed a succinct representation of a suffix tree ...
... efficient one . Compressed suffix arrays and compressed suf- fix trees are space efficient full - text index data structures that consume O ( n log ) bits . Munro et al . [ 28 ] developed a succinct representation of a suffix tree ...
Page 44
... efficient linear time construction of suffix arrays , CPM ( 2003 ) , 200-210 . 24. T.K. Lam , K. Sadakane , W.K. Sung , and S.M. Yiu , A space and time efficient algo- rithm for constructing compressed suffix arrays , Proc . of ...
... efficient linear time construction of suffix arrays , CPM ( 2003 ) , 200-210 . 24. T.K. Lam , K. Sadakane , W.K. Sung , and S.M. Yiu , A space and time efficient algo- rithm for constructing compressed suffix arrays , Proc . of ...
Page 177
... Efficient Radix Sort . Proc . 35th IEEE Symposium on Foundations of Computer Science , pp . 714-721 , 1994 . 4. Chen , M.T. and J. Seiferas . Efficient and Elegant Subword - Tree Construction . In A. Apostolico and Z. Galil , editors ...
... Efficient Radix Sort . Proc . 35th IEEE Symposium on Foundations of Computer Science , pp . 714-721 , 1994 . 4. Chen , M.T. and J. Seiferas . Efficient and Elegant Subword - Tree Construction . In A. Apostolico and Z. Galil , editors ...
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