Computing suffix links for suffix trees and arrays

DOI10.1016/J.IPL.2005.12.012zbMATH Open1184.68607OpenAlexW2160738675MaRDI QIDQ845941FDOQ845941

Authors: Moritz G. Maaß 

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.12.012

Recommendations

• Linear work suffix array construction
• On-line construction of suffix trees
• Suffix Arrays: A New Method for On-Line String Searches
• RECONSTRUCTING A SUFFIX ARRAY
• Faster suffix tree construction with missing suffix links

zbMATH Keywords

algorithmspattern matchingsuffix treessuffix arrayssuffix links

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites Work

• Algorithms on Strings, Trees and Sequences
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lowest common ancestors in trees and directed acyclic graphs
• Suffix Arrays: A New Method for On-Line String Searches
• A Space-Economical Suffix Tree Construction Algorithm
• Linear time algorithms for finding and representing all the tandem repeats in a string
• On-line construction of suffix trees
• Space efficient linear time construction of suffix arrays
• Sublinear approximate string matching and biological applications
• Title not available (Why is that?)
• Linear-time construction of suffix arrays (extended abstract)
• Replacing suffix trees with enhanced suffix arrays
• From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
• Title not available (Why is that?)

Cited In (5)

• Title not available (Why is that?)
• 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)