The following pages link to Dynamic extended suffix arrays (Q972366):
Displaying 11 items.
- On the number of elements to reorder when updating a suffix array (Q414460) (← links)
- On-line suffix tree construction with reduced branching (Q414471) (← links)
- Using static suffix array in dynamic application: case of text compression by longest first substitution (Q477617) (← links)
- Position heaps: a simple and dynamic text indexing data structure (Q533414) (← links)
- On suffix extensions in suffix trees (Q714837) (← links)
- On updating suffix tree labels (Q1129015) (← links)
- Extended suffix array construction using Lyndon factors (Q1615410) (← links)
- A linear time lower bound on McCreight and general updating algorithms for suffix trees (Q1879368) (← links)
- Dynamic index and LZ factorization in compressed space (Q2295634) (← links)
- Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree (Q2942273) (← links)
- (Q6065473) (← links)
