Cargando…
Perfect Hamming code with a hash table for faster genome mapping
BACKGROUND: With the advent of next-generation sequencers, the growing demands to map short DNA sequences to a genome have promoted the development of fast algorithms and tools. The tools commonly used today are based on either a hash table or the suffix array/Burrow–Wheeler transform. These algorit...
Autores principales: | Takenaka, Yoichi, Seno, Shigeto, Matsuda, Hideo |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2011
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3333191/ https://www.ncbi.nlm.nih.gov/pubmed/22369457 http://dx.doi.org/10.1186/1471-2164-12-S3-S8 |
Ejemplares similares
-
An estimation method for inference of gene regulatory net-work using Bayesian network with uniting of partial problems
por: Watanabe, Yukito, et al.
Publicado: (2012) -
Accelerating read mapping with FastHASH
por: Xin, Hongyi, et al.
Publicado: (2013) -
The joys of hashing: hash table programming with C
por: Mailund, Thomas
Publicado: (2019) -
Protein sequence classification using feature hashing
por: Caragea, Cornelia, et al.
Publicado: (2012) -
Metagenome fragment classification based on multiple motif-occurrence profiles
por: Matsushita, Naoki, et al.
Publicado: (2014)