A theoretical and experimental study on the construction of suffix arrays in external memory

DOI10.1007/S00453-001-0051-5zbMATH Open0995.68032OpenAlexW1726445723MaRDI QIDQ5956830FDOQ5956830

Paolo Ferragina, A. Crauser

Publication date: 28 February 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11858/00-001M-0000-0014-6F9B-2

zbMATH Keywords

suffix arrayfull-text indexing data structures

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Cited In (6)

• Engineering a lightweight external memory suffix array construction algorithm
• Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays
• Fast BWT in small space by blockwise suffix sorting
• Faster Compressed Suffix Trees for Repetitive Collections
• Lightweight data indexing and compression in external memory
• Engineering External Memory Induced Suffix Sorting

Uses Software

• LEDA

Recommendations

• Title not available (Why is that?) 👍 👎
• Linear-Time Construction of Suffix Arrays 👍 👎
• Inducing Suffix and LCP Arrays in External Memory 👍 👎
• External Memory Generalized Suffix and LCP Arrays Construction 👍 👎
• Engineering External Memory Induced Suffix Sorting 👍 👎
• Better external memory suffix array construction 👍 👎
• Engineering a lightweight external memory suffix array construction algorithm 👍 👎

This page was built for publication: A theoretical and experimental study on the construction of suffix arrays in external memory

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