Caricamento...
Compacting de Bruijn graphs from sequencing data quickly and in low memory
Motivation: As the quantity of data per sequencing experiment increases, the challenges of fragment assembly are becoming increasingly computational. The de Bruijn graph is a widely used data structure in fragment assembly algorithms, used to represent the information from a set of reads. Compaction...
Salvato in:
| Pubblicato in: | Bioinformatics |
|---|---|
| Autori principali: | , , |
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
Oxford University Press
2016
|
| Soggetti: | |
| Accesso online: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4908363/ https://ncbi.nlm.nih.gov/pubmed/27307618 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1093/bioinformatics/btw279 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !
|