S
Sen Zhang
Researcher at State University of New York at Oneonta
Publications - 8
Citations - 425
Sen Zhang is an academic researcher from State University of New York at Oneonta. The author has contributed to research in topics: Suffix array & Time complexity. The author has an hindex of 6, co-authored 7 publications receiving 392 citations. Previous affiliations of Sen Zhang include State University of New York at Purchase & State University of New York System.
Papers
More filters
Journal ArticleDOI
Two Efficient Algorithms for Linear Time Suffix Array Construction
Ge Nong,Sen Zhang,Wai Hong Chan +2 more
TL;DR: Two efficient algorithms for linear time suffix array construction, using the techniques of divide-and-conquer, and recursion, that yield the best time and space efficiencies among all the existing linear time SACAs.
Proceedings ArticleDOI
Linear Suffix Array Construction by Almost Pure Induced-Sorting
Ge Nong,Sen Zhang,Wai Hong Chan +2 more
TL;DR: The experimental results demonstrate that this newly proposed algorithm yields noticeably better time and space efficiencies than all the currently published linear time algorithms for SA construction.
Journal ArticleDOI
Suffix Array Construction in External Memory Using D-Critical Substrings
TL;DR: 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.
Book ChapterDOI
Linear Time Suffix Array Construction Using D-Critical Substrings
Ge Nong,Sen Zhang,Wai Hong Chan +2 more
TL;DR: The results of the experiment indicate that the D-Critical-Substring algorithm outperforms the two previously best-known linear time algorithms: the Karkkainen-Sanders (KS) and the Ko-Aluru (KA).
Proceedings ArticleDOI
Fast and Space Efficient Linear Suffix Array Construction
Sen Zhang,Ge Nong +1 more
TL;DR: The Burrows-Wheeler transform for building efficient compression solutions can be quickly computed by fast suffix sorting based on suffix array construction algorithms (SACAs).