Campus Event Calendar
Event Entry
What and Who
External Memory Suffix Array Construction
Jens Mehnert
Max-Planck-Institut für Informatik - AG 1
Talk
AG 1
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Friday, 17 December 2004
15:00
-- Not specified --
Warning: Time has changed!
46.1 - MPII
024
Saarbrücken
Abstract
In the recent years, a lot of theoretical work has been done on suffix tree and suffix array construction. In 2000, it was shown that suffix trees and thereby suffix arrays (converted from the suffix trees) over an integer alphabet, can be constructed in linear time. In 2003, three linear suffix array construction algorithms were published which do not require suffix trees. We have adapted one of these algorithms to external memory and applied several improvements to it and other external memory suffix array construction algorithms. One of these improvement is called pipelining which reduces the I/Os of the algorithms, significantly.
Contact
Jens Mehnert
--email hidden
passcode not visible
logged in users only
Jens Mehnert, 12/13/2004 16:54
Jens Mehnert, 12/06/2004 15:16
Jens Mehnert, 12/03/2004 16:47 -- Created document.
Jens Mehnert, 12/06/2004 15:16
Jens Mehnert, 12/03/2004 16:47 -- Created document.