Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2005 - Combinatorial analysis |
From inside the book
Results 1-3 of 91
Page 33
... suffix arrays and suffix trees , which implies they were not constructed in optimal O ( n log | ) -bit working space . Recently , several methods were developed for constructing compressed suffix arrays and compressed suffix trees in ...
... suffix arrays and suffix trees , which implies they were not constructed in optimal O ( n log | ) -bit working space . Recently , several methods were developed for constructing compressed suffix arrays and compressed suffix trees in ...
Page 34
... suffix trees and suffix arrays without requiring much space . The enhanced suffix array due to Abouelhoda et al . [ 1 , 2 ] is such an index data structure . It consists of a pos array ( suffix array ) , an lcp array , and a child table ...
... suffix trees and suffix arrays without requiring much space . The enhanced suffix array due to Abouelhoda et al . [ 1 , 2 ] is such an index data structure . It consists of a pos array ( suffix array ) , an lcp array , and a child table ...
Page 44
... suffix arrays and suffix trees with applica- tions to text indexing and string matching , STOC ( 2000 ) , 397-406 . 14. D. Gusfield , Algorithms on Strings , Trees , and Sequences , Cambridge Univ . Press ( 1997 ) . 15. W.K. Hon and K ...
... suffix arrays and suffix trees with applica- tions to text indexing and string matching , STOC ( 2000 ) , 397-406 . 14. D. Gusfield , Algorithms on Strings , Trees , and Sequences , Cambridge Univ . Press ( 1997 ) . 15. W.K. Hon and K ...
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