Succinct Suffix Arrays Based on Run-Length Encoding
Lecture notes in computer science2005pp. 45–56
Citations Over TimeTop 10% of 2005 papers
Related Papers
- → Compressed Suffix Trees with Full Functionality(2007)294 cited
- → A time and space efficient data structure for string searching on large texts(1996)27 cited
- Linear-Time Search in Suffix Arrays(2005)
- Time and Space Efficient Search with Suffix Arrays(2005)
- → Suffix Trays and Suffix Trists: Structures for Faster Text Indexing(2014)