Cargando…
Towards computational improvement of DNA database indexing and short DNA query searching
In order to facilitate and speed up the search of massive DNA databases, the database is indexed at the beginning, employing a mapping function. By searching through the indexed data structure, exact query hits can be identified. If the database is searched against an annotated DNA query, such as a...
Autores principales: | Stojanov, Done, Koceski, Sašo, Mileva, Aleksandra, Koceska, Nataša, Bande, Cveta Martinovska |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Taylor & Francis
2014
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4434100/ https://www.ncbi.nlm.nih.gov/pubmed/26019584 http://dx.doi.org/10.1080/13102818.2014.959711 |
Ejemplares similares
-
A Telemedicine Robot System for Assisted and Independent Living
por: Koceska, Natasa, et al.
Publicado: (2019) -
ToRQuEMaDA: tool for retrieving queried Eubacteria, metadata and dereplicating assemblies
por: Léonard, Raphaël R., et al.
Publicado: (2021) -
SAM: String-based sequence search algorithm for mitochondrial DNA database queries
por: Röck, Alexander, et al.
Publicado: (2011) -
Tucuxi-BLAST: Enabling fast and accurate record linkage of large-scale health-related administrative databases through a DNA-encoded approach
por: Araujo, José Deney, et al.
Publicado: (2022) -
Similarity thresholds used in DNA sequence assembly from short reads can reduce the comparability of population histories across species
por: Harvey, Michael G., et al.
Publicado: (2015)