Cargando…
Parallel Generalized Suffix Tree Construction for Genomic Data
After a decade of digitization and technological advancements, we have an abundance of usable genomic data, which provide unique insights into our well-being. However, such datasets are large in volume, and retrieving meaningful information from them is often challenging. Hence, different indexing t...
Autores principales: | Aziz, Md Momin Al, Thulasiraman, Parimala, Mohammed, Noman |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7197101/ http://dx.doi.org/10.1007/978-3-030-42266-0_1 |
Ejemplares similares
-
Parallel and private generalized suffix tree construction and query on genomic data
por: Al Aziz, Md Momin, et al.
Publicado: (2022) -
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) -
Using the Sadakane Compressed Suffix Tree to Solve the All-Pairs Suffix-Prefix Problem
por: Haj Rachid, Maan, et al.
Publicado: (2014) -
Secure approximation of edit distance on genomic data
por: Aziz, Md Momin Al, et al.
Publicado: (2017)