Cargando…
External memory BWT and LCP computation for sequence collections with applications
BACKGROUND: Sequencing technologies produce larger and larger collections of biosequences that have to be stored in compressed indices supporting fast search operations. Many compressed indices are based on the Burrows–Wheeler Transform (BWT) and the longest common prefix (LCP) array. Because of the...
Autores principales: | Egidi, Lavinia, Louza, Felipe A., Manzini, Giovanni, Telles, Guilherme P. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6408864/ https://www.ncbi.nlm.nih.gov/pubmed/30899322 http://dx.doi.org/10.1186/s13015-019-0140-0 |
Ejemplares similares
-
gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections
por: Louza, Felipe A., et al.
Publicado: (2020) -
Wheeler graphs: A framework for BWT-based data structures()
por: Gagie, Travis, et al.
Publicado: (2017) -
phyBWT2: phylogeny reconstruction via eBWT positional clustering
por: Guerrini, Veronica, et al.
Publicado: (2023) -
Generalized enhanced suffix array construction in external memory
por: Louza, Felipe A., et al.
Publicado: (2017) -
SNPs detection by eBWT positional clustering
por: Prezza, Nicola, et al.
Publicado: (2019)