An algorithm for computing Burrows-Wheeler transform using q-grams
We have conducted an exploration on the role of q-grams in suffix array construction and Burrows-Wheeler transformation and its effect on minimizing the required amount of workspace. As one of the existing lightweight suffix array construction algorithms, we have studied Seward's algorithm and...
| Autor principal: | |
|---|---|
| Formato: | Tese |
| Idioma: | English |
| Publicado em: |
Quezon City
College of Engineering, University of the Philippines Diliman
2013
|
| Assuntos: |