Cargando…
Fast randomized approximate string matching with succinct hash data structures
BACKGROUND: The high throughput of modern NGS sequencers coupled with the huge sizes of genomes currently analysed, poses always higher algorithmic challenges to align short reads quickly and accurately against a reference sequence. A crucial, additional, requirement is that the data structures used...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
BioMed Central
2015
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4464037/ https://www.ncbi.nlm.nih.gov/pubmed/26051265 http://dx.doi.org/10.1186/1471-2105-16-S9-S4 |