Cargando…
Parallel and private generalized suffix tree construction and query on genomic data
BACKGROUND: Several technological advancements and digitization of healthcare data have provided the scientific community with a large quantity of genomic data. Such datasets facilitated a deeper understanding of several diseases and our health in general. Strikingly, these genome datasets require a...
Autores principales: | Al Aziz, Md Momin, Thulasiraman, Parimala, Mohammed, Noman |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9206251/ https://www.ncbi.nlm.nih.gov/pubmed/35715724 http://dx.doi.org/10.1186/s12863-022-01053-x |
Ejemplares similares
-
Parallel Generalized Suffix Tree Construction for Genomic Data
por: Aziz, Md Momin Al, et al.
Publicado: (2020) -
Relative Suffix Trees
por: Farruggia, Andrea, et al.
Publicado: (2018) -
Generalized enhanced suffix array construction in external memory
por: Louza, Felipe A., et al.
Publicado: (2017) -
GHOSTX: An Improved Sequence Homology Search Algorithm Using a Query Suffix Array and a Database Suffix Array
por: Suzuki, Shuji, et al.
Publicado: (2014) -
Using the Sadakane Compressed Suffix Tree to Solve the All-Pairs Suffix-Prefix Problem
por: Haj Rachid, Maan, et al.
Publicado: (2014)