Caricamento...
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...
Salvato in:
| Pubblicato in: | BMC Bioinformatics |
|---|---|
| Autori principali: | , |
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
BioMed Central
2015
|
| Soggetti: | |
| Accesso online: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4464037/ https://ncbi.nlm.nih.gov/pubmed/26051265 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1186/1471-2105-16-S9-S4 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !
|