Pages that link to "Item:Q1386367"
From MaRDI portal
The following pages link to From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction (Q1386367):
Displaying 14 items.
- On-line suffix tree construction with reduced branching (Q414471) (← links)
- On suffix extensions in suffix trees (Q714837) (← links)
- Computing suffix links for suffix trees and arrays (Q845941) (← links)
- Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays (Q1006380) (← links)
- Truncated suffix trees and their application to data compression. (Q1401392) (← links)
- A framework for space-efficient string kernels (Q1679234) (← links)
- Collage system: A unifying framework for compressed pattern matching. (Q1874240) (← links)
- A linear time lower bound on McCreight and general updating algorithms for suffix trees (Q1879368) (← links)
- On-line construction of parameterized suffix trees for large alphabets (Q1944073) (← links)
- Space-efficient representation of truncated suffix trees, with applications to Markov order estimation (Q2354764) (← links)
- Irredundant tandem motifs (Q2437750) (← links)
- Dynamic construction of an antidictionary with linear complexity (Q2437769) (← links)
- Distributed suffix trees (Q2569396) (← links)
- Online Suffix Tree Construction for Streaming Sequences (Q3628498) (← links)
