Cargando…
gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections
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 often needed...
| Autores principales: | , , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
BioMed Central
2020
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7507297/ https://www.ncbi.nlm.nih.gov/pubmed/32973918 http://dx.doi.org/10.1186/s13015-020-00177-y |