The following pages link to Mikaël Salson (Q2628799):
Displaying 8 items.
- (Q414459) (redirect page) (← links)
- On the number of elements to reorder when updating a suffix array (Q414460) (← links)
- Efficient dynamic range minimum query (Q507385) (← links)
- A four-stage algorithm for updating a Burrows-Wheeler transform (Q732025) (← links)
- Dynamic extended suffix arrays (Q972366) (← links)
- Approximate search of short patterns with high error rates using the \(01^\ast 0\) lossless seeds (Q2628801) (← links)
- Lossless Seeds for Searching Short Patterns with High Error Rates (Q2946072) (← links)
- On the number of $k$-mers admitting a given lexicographical minimizer (Q6759521) (← links)
