The following pages link to Guilherme P. Telles (Q344530):
Displaying 12 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)
- On the consecutive ones property (Q1281779) (← links)
- Lyndon array construction during Burrows-Wheeler inversion (Q1632505) (← links)
- Parallel computation for the all-pairs suffix-prefix problem (Q1796839) (← links)
- Practical regular expression constrained sequence alignment (Q2310751) (← 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)
- (Q3186730) (← links)
- Building PQR trees in almost-linear time (Q3439658) (← links)
- (Q5090335) (← links)
