RECONSTRUCTING A SUFFIX ARRAY

DOI10.1142/S0129054106004418zbMATH Open1169.68381OpenAlexW2058305583MaRDI QIDQ3421844FDOQ3421844

Authors: Frantisek Franek, W. F. Smyth 

Publication date: 8 February 2007

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054106004418

Recommendations

• scientific article; zbMATH DE number 1947433
• Engineering a lightweight suffix array construction algorithm
• Computing suffix links for suffix trees and arrays
• Space efficient linear time construction of suffix arrays
• An elegant algorithm for the construction of suffix arrays

zbMATH Keywords

lexicographic orderstringsuffix treesuffix arrayalphabet

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites Work

• Suffix Arrays: A New Method for On-Line String Searches
• Engineering a lightweight suffix array construction algorithm

Cited In (10)

• On left and right seeds of a string
• On the number of elements to reorder when updating a suffix array
• Extended suffix array construction using Lyndon factors
• Reconstructing parameterized strings from parameterized suffix and LCP arrays
• Recovering, counting and enumerating strings from forward and backward suffix arrays
• Indeterminate strings, prefix arrays \& undirected graphs
• Reconstructing parameterized strings from parameterized suffix and LCP arrays
• Constructing an indeterminate string from its associated graph
• Computing suffix links for suffix trees and arrays
• Inferring an indeterminate string from a prefix graph

This page was built for publication: RECONSTRUCTING A SUFFIX ARRAY

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3421844)