Using cascading Bloom filters to improve the memory usage for de Brujin graphs.
about
Recovering complete and draft population genomes from metagenome datasetsCandidate pathogenicity islands in the genome of 'Candidatus Rickettsiella isopodorum', an intracellular bacterium infecting terrestrial isopod crustaceansReference-free compression of high throughput sequencing data with a probabilistic de Bruijn graph.SNP calling from RNA-seq data without a reference genome: identification, quantification, differential analysis and impact on the protein sequenceImproving Bloom Filter Performance on Sequence Data Using k-mer Bloom Filters.GATB: Genome Assembly & Analysis Tool Box.MindTheGap: integrated detection and assembly of short and long insertionsMerging of multi-string BWTs with applicationsDIDA: Distributed Indexing Dispatched Alignment.Multiple Conserved Heteroplasmic Sites in tRNA Genes in the Mitochondrial Genomes of Terrestrial Isopods (Oniscidea)Fast search of thousands of short-read sequencing experimentsColib'read on galaxy: a tools suite dedicated to biological information extraction from raw NGS reads.LightAssembler: fast and memory-efficient assembly algorithm for high-throughput sequencing reads.Reference-free detection of isolated SNPs.deBGR: an efficient and near-exact representation of the weighted de Bruijn graph.LoRDEC: accurate and efficient long read error correction.Genotyping-by-sequencing data of 272 crested wheatgrass (Agropyron cristatum) genotypes.ChopStitch: exon annotation and splice graph construction using transcriptome assembly and whole genome sequencing data.
P2860
Q28077819-B4DD6387-7FD9-42A1-AAEA-6478DC7C5C98Q28818678-1621F064-4332-4A51-941F-5AA287C1C5B2Q30993562-2F3DE117-A768-4A4F-A460-38EFCC55AC6BQ31117543-60F41FC5-7F92-4BC5-BCBC-747E8A37F86CQ31141637-E317A81C-8622-44B1-BE42-24777A6EB125Q31170927-6A5F6517-69AE-4E41-ADDE-54A5B83FB5A8Q34621357-F6A049A0-2C86-446A-B4AB-B027553E46F1Q35055235-88CBA76D-D20A-487C-A7EA-E13216ABAE34Q35617757-301C0783-8C78-4D04-B34E-3F1A6432EA3FQ35851848-9A90B2ED-AD23-44BE-89DB-C72136C8C169Q36719760-4032ACFD-2231-4CFC-8821-6A156DBC86CEQ38365585-23D530D4-53DC-4CCD-843C-52E61F5454D7Q39605041-43417A89-7DDF-4A10-9D63-F6AD8B884661Q42037832-A3F8EE79-BEDC-4663-B1F9-9B330E91BE93Q42697222-87C52500-9B23-43D0-A4C6-268C689DE7A1Q43053295-049B0F74-ED23-4A60-BDF7-97E1E3AA3A28Q46246358-68E27274-7F5E-4214-A801-CC88D3CAD994Q47209918-9DAF7B82-5098-4E6B-99DB-4CFED8591235
P2860
Using cascading Bloom filters to improve the memory usage for de Brujin graphs.
description
2014 nî lūn-bûn
@nan
2014年の論文
@ja
2014年論文
@yue
2014年論文
@zh-hant
2014年論文
@zh-hk
2014年論文
@zh-mo
2014年論文
@zh-tw
2014年论文
@wuu
2014年论文
@zh
2014年论文
@zh-cn
name
Using cascading Bloom filters to improve the memory usage for de Brujin graphs.
@en
type
label
Using cascading Bloom filters to improve the memory usage for de Brujin graphs.
@en
prefLabel
Using cascading Bloom filters to improve the memory usage for de Brujin graphs.
@en
P2860
P356
P1476
Using cascading Bloom filters to improve the memory usage for de Brujin graphs.
@en
P2093
Gustavo Sacomoto
Kamil Salikhov
P2860
P2888
P356
10.1186/1748-7188-9-2
P577
2014-02-24T00:00:00Z
P5875
P6179
1016211432