Pages that link to "Item:Q1853020"
From MaRDI portal
The following pages link to Time-space trade-offs for compressed suffix arrays. (Q1853020):
Displaying 9 items.
- Ultra-succinct representation of ordered trees with applications (Q414928) (← links)
- Improved space-time tradeoffs for approximate full-text indexing with one edit error (Q494804) (← links)
- Improved approximate string matching using compressed suffix data structures (Q930602) (← links)
- A space and time efficient algorithm for constructing compressed suffix arrays (Q996703) (← links)
- Improved and extended locating functionality on compressed suffix arrays (Q2343300) (← links)
- Space efficient suffix trees (Q2729650) (← links)
- Locally compressed suffix arrays (Q2828176) (← links)
- A categorization theorem on suffix arrays with applications to space efficient text indexes (Q2921650) (← links)
- (Q5501319) (← links)