Please note that eDoc will be permanently shut down in the first quarter of 2021!      Home News About Us Contact Contributors Disclaimer Privacy Policy Help FAQ

Home
Search
Quick Search
Advanced
Fulltext
Browse
Collections
Persons
My eDoc
Session History
Login
Name:
Password:
Documentation
Help
Support Wiki
Direct access to
document ID:


          Institute: MPI für Informatik     Collection: Algorithms and Complexity Group     Display Documents



ID: 201869.0, MPI für Informatik / Algorithms and Complexity Group
Fast Lightweight Suffix Array Construction and Checking
Authors:Burkhardt, Stefan; Kärkkäinen, Juha
Editors:Baeza-Yates, R.; Chávez, E.; Crochemore, M.
Language:English
Publisher:Springer
Place of Publication:Heidelberg, Germany
Date of Publication (YYYY-MM-DD):2003
Title of Proceedings:Combinatorial Pattern Matching: 14th Annual Symposium, CPM 2003
Start Page:55
End Page:69
Title of Series:Lecture Notes in Computer Science
Place of Conference/Meeting:Morelia, Michoacán, Mexico
(Start) Date of Conference/Meeting
 (YYYY-MM-DD):
2003-06-25
Audience:Experts Only
Intended Educational Use:No
Abstract / Description:We describe an algorithm that, for any $v\in[2,n]$, constructs
the suffix array of a string of length $n$ in $\Oh{vn + n \log
n}$ time using $\Oh{v+n/\sqrt{v}}$ space in addition to the
input (the string) and the output (the suffix array). By setting
$v=\log n$, we obtain an $\Oh{n \log n}$ time algorithm using
$\Oh{n/\sqrt{\log n}}$ extra space. This solves the open problem
stated by Manzini and Ferragina [ESA\;'02] of whether there
exists a lightweight (sublinear extra space) $\Oh{n \log n}$ time
algorithm. The key idea of the algorithm is to first sort a
sample of suffixes chosen using mathematical constructs called
difference covers. The algorithm is not only lightweight but also
fast in practice as demonstrated by experiments. Additionally,
we describe fast and lightweight suffix array checkers, i.e.,
algorithms that check the correctness of a suffix array.
Last Change of the Resource (YYYY-MM-DD):2004-08-02
External Publication Status:published
Document Type:Conference-Paper
Communicated by:Kurt Mehlhorn
Affiliations:MPI für Informatik/Algorithms and Complexity Group
Identifiers:LOCALID:C1256428004B93B8-3E2B1773D0314EDEC1256E8A002B0F6D-...
ISSN:0302-9743
Full Text:
You have privileges to view the following file(s):
cpm03.pdf  [222,00 Kb] [Comment:file from upload service]  
 
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.