Compacting de Bruijn graphs from sequencing data quickly and in low memory
about
ABySS 2.0: resource-efficient assembly of large genomes using a Bloom filter.TwoPaCo: an efficient algorithm to build the compacted de Bruijn graph from many complete genomes.Faucet: streaming de novo assembly graph construction.Improving the performance of minimizers and winnowing schemes.Pan-Genome Storage and Analysis Techniques.A space and time-efficient index for the compacted colored de Bruijn graph.Predicting bacterial resistance from whole-genome sequences using k-mers and stability selectionBrownieAligner: accurate alignment of Illumina sequencing data to de Bruijn graphs
P2860
Q33622598-C1C9BD05-27D0-4DC5-B3A7-FE8F9F467D66Q39360537-E786948A-8AAA-422A-9665-A3A96EC07113Q42696052-AAB48840-36D8-4D60-8853-1D1E6AC898DAQ42697264-F2E082FE-93C3-4459-BA9F-B5B53EBF73CAQ47249270-ED00428B-D3A4-45F3-8728-F95A18B6807FQ55514196-5B1868DE-467C-4B4E-A008-610A31A85F82Q58605130-B809ED3F-390B-4426-90E6-A4E58006B701Q58765751-FDF11398-A41C-4A6D-A771-94AC13091F9D
P2860
Compacting de Bruijn graphs from sequencing data quickly and in low memory
description
2016 nî lūn-bûn
@nan
2016年の論文
@ja
2016年論文
@yue
2016年論文
@zh-hant
2016年論文
@zh-hk
2016年論文
@zh-mo
2016年論文
@zh-tw
2016年论文
@wuu
2016年论文
@zh
2016年论文
@zh-cn
name
Compacting de Bruijn graphs from sequencing data quickly and in low memory
@ast
Compacting de Bruijn graphs from sequencing data quickly and in low memory
@en
type
label
Compacting de Bruijn graphs from sequencing data quickly and in low memory
@ast
Compacting de Bruijn graphs from sequencing data quickly and in low memory
@en
prefLabel
Compacting de Bruijn graphs from sequencing data quickly and in low memory
@ast
Compacting de Bruijn graphs from sequencing data quickly and in low memory
@en
P2093
P2860
P356
P1433
P1476
Compacting de Bruijn graphs from sequencing data quickly and in low memory
@en
P2093
Antoine Limasset
Paul Medvedev
Rayan Chikhi
P2860
P304
P356
10.1093/BIOINFORMATICS/BTW279
P407
P577
2016-06-01T00:00:00Z