Pages that link to "Item:Q1349954"
From MaRDI portal
The following pages link to A time and space efficient data structure for string searching on large texts (Q1349954):
Displaying 9 items.
- Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays (Q1006380) (← links)
- The suffix binary search tree and suffix AVL tree (Q1827266) (← links)
- Squares, cubes, and time-space efficient string searching (Q1894296) (← links)
- Suffix Arrays: A New Method for On-Line String Searches (Q3142586) (← links)
- (Q4426347) (← links)
- A high-speed dynamic full-text search method by using memory management (Q4652853) (← links)
- A Memory-Efficient and Modular Approach for Large-Scale String Pattern Matching (Q5274383) (← links)
- (Q5305177) (← links)
- String Processing and Information Retrieval (Q5393949) (← links)