gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections

gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections

Abstract Background The construction of a suffix array for a collection of strings is a fundamental task in Bioinformatics and in many other applications that process strings. Related data structures, as the Longest Common Prefix array, the Burrows–Wheeler transform, and the document array, are ofte...

Full description

Bibliographic Details
Main Authors: Felipe A. Louza, Guilherme P. Telles, Simon Gog, Nicola Prezza, Giovanna Rosone
Format: Article
Language:English
Published: BMC 2020-09-01
Series:Algorithms for Molecular Biology
Subjects:
Suffix array
LCP array
Burrows–Wheeler transform
Document array
String collections
Online Access:http://link.springer.com/article/10.1186/s13015-020-00177-y

Internet

http://link.springer.com/article/10.1186/s13015-020-00177-y

Similar Items