Pages that link to "Item:Q2384787"
From MaRDI portal
The following pages link to On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time (Q2384787):
Displayed 7 items.
- Linear-time construction of two-dimensional suffix trees (Q627547) (← links)
- Improving on-line construction of two-dimensional suffix trees for square matrices (Q987807) (← links)
- Finding patterns and periods in Cartesian tree matching (Q2207506) (← links)
- A Note on a Tree-Based 2D Indexing (Q3073649) (← links)
- TREE-BASED 2D INDEXING (Q3224955) (← links)
- Forty Years of Text Indexing (Q4928554) (← links)
- Cartesian Tree Matching and Indexing (Q5088906) (← links)
