Pages that link to "Item:Q732025"
From MaRDI portal
The following pages link to A four-stage algorithm for updating a Burrows-Wheeler transform (Q732025):
Displaying 11 items.
- On the number of elements to reorder when updating a suffix array (Q414460) (← links)
- Binary block order Rouen transform (Q507387) (← links)
- On suffix extensions in suffix trees (Q714837) (← links)
- Dynamic extended suffix arrays (Q972366) (← links)
- A survey of string orderings and their application to the Burrows-Wheeler transform (Q1698705) (← links)
- Sliding suffix tree (Q2331636) (← links)
- Computing the Burrows-Wheeler transform in place and in small space (Q2343299) (← links)
- Indeterminate string factorizations and degenerate text transformations (Q2363995) (← links)
- A bijective variant of the Burrows-Wheeler transform using \(V\)-order (Q2441784) (← links)
- Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure (Q3637103) (← links)
- (Q6065473) (← links)
