The following pages link to (Q3140444):
Displaying 11 items.
- Dynamic suffix tree and two-dimensional texts management (Q287000) (← links)
- The submatrices character count problem: An efficient solution using separable values (Q598188) (← links)
- Parallel construction and query of index data structures for pattern matching on square matrices (Q1288531) (← links)
- Two-dimensional prefix string matching and covering on square matrices (Q1386343) (← links)
- Generalizations of suffix arrays to multi-dimensional matrices. (Q1401328) (← links)
- Random suffix search trees (Q4446869) (← links)
- On the construction of classes of suffix trees for square matrices: Algorithms and applications (Q4645171) (← links)
- An index data structure for matrices, with applications to fast two-dimensional pattern matching (Q5060126) (← links)
- Structural Pattern Matching - Succinctly. (Q5136254) (← links)
- Two-dimensional pattern matching on a dynamic library of texts (Q6085750) (← links)
- Two-dimensional dynamic dictionary matching (Q6487428) (← links)