title: Prospects and limitations of full-text index structures in genome analysis.
abstract: The combination of incessant advances in sequencing technology producing large amounts of data and innovative bioinformatics approaches, designed to cope with this data flood, has led to new interesting results in the life sciences. Given the magnitude of sequence data to be processed, many bioinformatics tools rely on efficient solutions to a variety of complex string problems. These solutions include fast heuristic algorithms and advanced data structures, generally referred to as index structures. Although the importance of index structures is generally known to the bioinformatics community, the design and potency of these data structures, as well as their properties and limitations, are less understood. Moreover, the last decade has seen a boom in the number of variant index structures featuring complex and diverse memory-time trade-offs. This article brings a comprehensive state-of-the-art overview of the most popular index structures and their recently developed variants. Their features, interrelationships, the trade-offs they impose, but also their practical limitations, are explained and compared.
authors.affiliation: Department of Applied Mathematics and Computer Science, Ghent University, Building S9, 281 Krijgslaan, Belgium. michael.vyverman@ugent.be
authors.forename: Michaël
authors.initials: M
authors.lastname: Vyverman
authors.forename: Bernard
authors.initials: B
authors.lastname: De Baets
authors.forename: Veerle
authors.initials: V
authors.lastname: Fack
authors.forename: Peter
authors.initials: P
authors.lastname: Dawyndt
mesh_terms: D000465:Algorithms; D023281:Genomics / Q000379:methods*; D017421:Sequence Analysis / Q000379:methods*