Cargando…
Improved Lower Bounds of DNA Tags Based on a Modified Genetic Algorithm
The well-known massively parallel sequencing method is efficient and it can obtain sequence data from multiple individual samples. In order to ensure that sequencing, replication, and oligonucleotide synthesis errors do not result in tags (or barcodes) that are unrecoverable or confused, the tag seq...
Autores principales: | Wang, Bin, Wei, Xiaopeng, Dong, Jing, Zhang, Qiang |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2015
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4332859/ https://www.ncbi.nlm.nih.gov/pubmed/25693135 http://dx.doi.org/10.1371/journal.pone.0110640 |
Ejemplares similares
-
Correction: Improved Lower Bounds of DNA Tags Based on a Modified Genetic Algorithm
por: Wang, Bin, et al.
Publicado: (2015) -
A Novel Image Encryption Algorithm Based on DNA Subsequence Operation
por: Zhang, Qiang, et al.
Publicado: (2012) -
Algorithms to estimate the lower bounds of recombination with or without recurrent mutations
por: Liu, Xiaoming, et al.
Publicado: (2008) -
Strong convergence and bounded perturbation resilience of a modified proximal gradient algorithm
por: Guo, Yanni, et al.
Publicado: (2018) -
An Intelligent Optimization Algorithm for Constructing a DNA Storage Code: NOL-HHO
por: Yin, Qiang, et al.
Publicado: (2020)