The following pages link to Felipe A. Louza (Q344528):
Displaying 17 items.
- Optimal suffix sorting and LCP array construction for constant alphabets (Q344531) (← links)
- Burrows-Wheeler transform and LCP array construction in constant space (Q511147) (← links)
- Inducing enhanced suffix arrays for string collections (Q526901) (← links)
- Lyndon array construction during Burrows-Wheeler inversion (Q1632505) (← links)
- Parallel computation for the all-pairs suffix-prefix problem (Q1796839) (← links)
- A simple algorithm for computing the document array (Q2011038) (← links)
- Space efficient merging of de Bruijn graphs and Wheeler graphs (Q2118200) (← links)
- A new approach to regular \& indeterminate strings (Q2220865) (← links)
- An improved algorithm for the all-pairs suffix-prefix problem (Q2628805) (← links)
- Computing the BWT and the LCP Array in Constant Space (Q2798242) (← links)
- External Memory Generalized Suffix and LCP Arrays Construction (Q4928573) (← links)
- Construction of Fundamental Data Structures for Strings (Q5005912) (← links)
- (Q5090335) (← links)
- Computing Burrows-Wheeler similarity distributions for string collections (Q6109749) (← links)
- Inducing the Lyndon array (Q6536249) (← links)
- Space-efficient merging of succinct de Bruijn graphs (Q6536265) (← links)
- Comparative genomics with succinct colored de Bruijn graphs (Q6658084) (← links)