Replacing suffix trees with enhanced suffix arrays

The suffix tree is one of the most important data structures in string processing and comparative genomics. However, the space consumption of the suffix tree is a bottleneck in large scale applications such as genome analysis. In this article, we will overcome this obstacle. We will show how every a...

Full description

Bibliographic Details

Published in:	Journal of discrete algorithms (Amsterdam, Netherlands) Vol. 2; no. 1; pp. 53 - 86
Main Authors:	Abouelhoda, Mohamed Ibrahim, Kurtz, Stefan, Ohlebusch, Enno
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 2004
Subjects:	Genome comparison Pattern matching Repeat analysis Suffix array Suffix tree Suffix tree Suffix array Genome comparison Pattern matching Repeat analysis
ISSN:	1570-8667, 1570-8675
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!