Campus Event Calendar
Event Entry
New for: D1
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
Wednesday, 23 February 2005
13:30
30 Minutes
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
Eric Berberich
129
--email hidden
passcode not visible
logged in users only
Eric Berberich, 02/23/2005 12:40
Eric Berberich, 02/01/2005 17:49
Eric Berberich, 02/01/2005 17:47 -- Created document.
Eric Berberich, 02/01/2005 17:49
Eric Berberich, 02/01/2005 17:47 -- Created document.