The following pages link to (Q4886088):
Displaying 10 items.
- The property suffix tree with dynamic properties (Q294931) (← links)
- Position heaps: a simple and dynamic text indexing data structure (Q533414) (← links)
- Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances (Q732031) (← links)
- Pattern matching with address errors: rearrangement distances (Q923879) (← links)
- Property matching and weighted matching (Q932325) (← links)
- Optimal prefix and suffix queries on texts (Q975480) (← links)
- On updating suffix tree labels (Q1129015) (← links)
- A linear time lower bound on McCreight and general updating algorithms for suffix trees (Q1879368) (← links)
- Improved Dynamic Text Indexing (Q4242657) (← links)
- (Q4806145) (← links)