.png){kind=icon}
Return
Suffix Array Construction in External Memory Using D-Critical Substrings
.png){kind=icon}
PRE
AI
DOI：10.1145/2518175.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present a new suffix array construction algorithm that aims to build, in external memory, the suffix array for an input string of length n measured in the magnitude of tens of Giga characters over a constant or integer alphabet. The core of this algorithm is adapted from the framework of the original internal memory SA-DS algorithm that samples fixed-size d-critical substrings. This new external-memory algorithm, called EM-SA-DS, uses novel cache data structures to construct a suffix array in a sequential scanning manner with good data spatial locality: data is read from or written to disk sequentially. On the assumed external-memory model with RAM capacity Omega ((nB)(0.5)), disk capacity O(n), and size of each I/O block B, all measured in log n-bit words, the I/O complexity of EM-SA-DS is O(n/B). This work provides a general cache-based solution that could be further exploited to develop external-memory solutions for other suffix-array-related problems, for example, computing the longest-common-prefix array, using a modern personal computer with a typical memory configuration of 4GB RAM and a single disk.
Keywords:
Suffix array
sorting algorithm
external memory
Algorithms
Performance
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.1
Papers:
1.2K
Citations:
4.7K
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveEffect of red and blue light on acclimation of Chlamydomonas reinhardtii to CO2-limiting conditions
PREAI
ShareSaveShareSave no more