Computing suffix links for suffix trees and arrays
From MaRDI portal
(Redirected from Publication:845941)
Recommendations
Cites work
- scientific article; zbMATH DE number 2038766 (Why is no real title available?)
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- scientific article; zbMATH DE number 1786458 (Why is no real title available?)
- scientific article; zbMATH DE number 2119665 (Why is no real title available?)
- A Space-Economical Suffix Tree Construction Algorithm
- Algorithms on Strings, Trees and Sequences
- From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
- Linear time algorithms for finding and representing all the tandem repeats in a string
- Linear-time construction of suffix arrays (extended abstract)
- Lowest common ancestors in trees and directed acyclic graphs
- On-line construction of suffix trees
- Replacing suffix trees with enhanced suffix arrays
- Space efficient linear time construction of suffix arrays
- Sublinear approximate string matching and biological applications
- Suffix Arrays: A New Method for On-Line String Searches
Cited in
(7)- Reverse engineering of compact suffix trees and links: a novel algorithm
- scientific article; zbMATH DE number 2105038 (Why is no real title available?)
- A simple algorithm for computing the document array
- From Suffix Trees to Suffix Vectors
- \(k\)-abelian pattern matching
- The affix array data structure and its applications to RNA secondary structure analysis
- RECONSTRUCTING A SUFFIX ARRAY
This page was built for publication: Computing suffix links for suffix trees and arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845941)
