Cargando…
A parallel and incremental algorithm for efficient unique signature discovery on DNA databases
BACKGROUND: DNA signatures are distinct short nucleotide sequences that provide valuable information that is used for various purposes, such as the design of Polymerase Chain Reaction primers and microarray experiments. Biologists usually use a discovery algorithm to find unique signatures from DNA...
Autores principales: | Lee, Hsiao Ping, Sheu, Tzu-Fang, Tang, Chuan Yi |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2010
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2848650/ https://www.ncbi.nlm.nih.gov/pubmed/20230647 http://dx.doi.org/10.1186/1471-2105-11-132 |
Ejemplares similares
-
An algorithm of discovering signatures from DNA databases on a computer cluster
por: Lee, Hsiao Ping, et al.
Publicado: (2014) -
Efficient Serial and Parallel Algorithms for Selection of Unique Oligos in EST Databases
por: Mata-Montero, Manrique, et al.
Publicado: (2013) -
On the Accuracy and Parallelism of GPGPU-Powered Incremental Clustering Algorithms
por: Chen, Chunlei, et al.
Publicado: (2017) -
Incremental genetic K-means algorithm and its application in gene expression data analysis
por: Lu, Yi, et al.
Publicado: (2004) -
Efficient deformation algorithm for plasmid DNA simulations
por: Raposo, Adriano N, et al.
Publicado: (2014)