Pages that link to "Item:Q1882475"
From MaRDI portal
The following pages link to Engineering a lightweight suffix array construction algorithm (Q1882475):
Displayed 11 items.
- Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) (← links)
- The longest common extension problem revisited and applications to approximate string searching (Q616995) (← links)
- Fast, practical algorithms for computing all the repeats in a string (Q626893) (← links)
- Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays (Q1006380) (← links)
- A simpler analysis of Burrows-Wheeler-based compression (Q2465054) (← links)
- Fast BWT in small space by blockwise suffix sorting (Q2465056) (← links)
- Faster suffix sorting (Q2465058) (← links)
- RECONSTRUCTING A SUFFIX ARRAY (Q3421844) (← links)
- Linear Time Suffix Array Construction Using D-Critical Substrings (Q3637104) (← links)
- IN-PLACE UPDATE OF SUFFIX ARRAY WHILE RECODING WORDS (Q3655534) (← links)
- Space efficient algorithms for the Burrows-Wheeler backtransformation (Q5961973) (← links)