Abstract: The suffix tree is an index data structure that can be used to efficiently solve a myriad of sequence analysis problems.In large scale applications, however, its space consumption is a bottleneck. Suffix arrays use less space, but they lack crucial information. It will be shown how suffix arrays must be enhanced so that they can replace suffix trees.

Homepage of Dr. Enno Ohlebusch >>more

Theoretical Bioinformatics Group >>more