Pages that link to "Item:Q845941"
From MaRDI portal
The following pages link to Computing suffix links for suffix trees and arrays (Q845941):
Displaying 6 items.
- Reverse engineering of compact suffix trees and links: a novel algorithm (Q405568) (← links)
- \(k\)-abelian pattern matching (Q491150) (← links)
- A simple algorithm for computing the document array (Q2011038) (← links)
- The affix array data structure and its applications to RNA secondary structure analysis (Q2465645) (← links)
- From Suffix Trees to Suffix Vectors (Q3421852) (← links)
- (Q4820870) (← links)