| Grant number: | 18/21509-2 |
| Support Opportunities: | Scholarships abroad - Research Internship - Post-doctor |
| Start date: | December 15, 2018 |
| End date: | March 14, 2019 |
| Field of knowledge: | Physical Sciences and Mathematics - Computer Science - Computing Methodologies and Techniques |
| Principal Investigator: | Zhao Liang |
| Grantee: | Felipe Alves da Louza |
| Supervisor: | Giovanni Manzini |
| Host Institution: | Faculdade de Filosofia, Ciências e Letras de Ribeirão Preto (FFCLRP). Universidade de São Paulo (USP). Ribeirão Preto , SP, Brazil |
| Institution abroad: | Consiglio Nazionale delle Ricerche (CNR), Italy |
| Associated to the scholarship: | 17/09105-0 - Suffix sorting and string similarity measures, BP.PD |
Abstract The post-doctoral project conducted by the candidate deals with algorithms to compute the Burrows-Wheeler transform (BWT), and investigate string similarity measures based on the BWT. Recently, Egidi, Louza, Manzini and Telles [7] introduced an external memory algorithm to compute the BWT together with the LCP array for a string collection, and showed how to output the document array (DA). The authors also suggested a simple, scan based, external memory algorithm based on the BWT and DA to construct de Bruijn graphs in a succinct representation. The objective of this internship project is to implement the computation of DA together with the BWT, and present a practical external memory algorithm to compute succinct de Bruijn graphs for large string collections. | |
| News published in Agência FAPESP Newsletter about the scholarship: | |
| More itemsLess items | |
| TITULO | |
| Articles published in other media outlets ( ): | |
| More itemsLess items | |
| VEICULO: TITULO (DATA) | |
| VEICULO: TITULO (DATA) | |