Lanean...
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...
Gorde:
| Argitaratua izan da: | BMC Bioinformatics |
|---|---|
| Egile Nagusiak: | , |
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
BioMed Central
2015
|
| Gaiak: | |
| Sarrera elektronikoa: | 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 |
| Etiketak: |
Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|