Reducing the Space Requirement of Suffix Trees

Reducing the Space Requirement of Suffix Trees (1999)

by Stefan Kurtz

Venue:	Software – Practice and Experience
Citations:	109 - 10 self

Datum	Value	Source
TITLE	Reducing the Space Requirement of Suffix Trees	INFERENCE
AUTHOR NAME	Stefan Kurtz	SVM HeaderParse 0.2
AUTHOR AFFIL	; SUMMARY	SVM HeaderParse 0.2
AUTHOR ADDR	; Technische Fakultät, Universität Bielefeld, Postfach 100 131, 33501 Bielefeld, Germany	SVM HeaderParse 0.2
ABSTRACT	We show that suffix trees store various kinds of redundant information. We exploit these redundancies to obtain more space efficient representations. The most space efficient of our representations requires 20 bytes per input character in the worst case, and 10.1 bytes per input character on average for a collection of 42 files of different type. This is an advantage of more than 8 bytes per input character over previous work. Our representations can be constructed without extra space, and as fast as previous representations. The asymptotic running times of suffix tree applications are retained. Copyright © 1999 John Wiley & Sons, Ltd. KEY WORDS: data structures; suffix trees; implementation techniques; space reduction	SVM HeaderParse 0.2
YEAR	1999	INFERENCE
VENUE	Software – Practice and Experience	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	1149--1171	INFERENCE
VOLUME	29	INFERENCE
CITATIONS	38 found	ParsCit 1.0