What people are saying - Write a review
We haven't found any reviews in the usual places.
Sharper Upper and Lower Bounds for an Approximation Scheme
Text Indexing with Errors
Succinct Suffix Arrays Based on RunLength Encoding
20 other sections not shown
Other editions - View all
algorithm alignment alphabet appear applications approximate assume automaton bits blocks bound called character column common complexity compressed compute consider consists construction contains corresponding data structure defined Definition denote described distance edges edit efficient encoding errors example exists expression extended Figure function gene genome give given graph input instance integer interval label Lemma length linear mass matching maximal method minimal motif multiset node Note obtained occurrences optimal pair path pattern points position possible PQ tree prefix present probability problem procedure programming Proof reduce regular relations represent respectively running Science score sequences similar solution solved space step stored string structure substring suffix suffix array suffix tree symbols takes Theorem tree University vertex weight