Memory-efficient Assembly Algorithms
Memory-Efficient Assembly Algorithms is a class of computational methods in de Bruijn graph-based genome assembly that minimizes memory usage through optimized data structures and traversal strategies while maintaining high accuracy in reconstructing biological sequences.
68
Publications
15.9K
Citations
224
Authors
109
Institutions
Publications per year
2017–2026
25
Parents
68
SOAPdenovo2: an empirically improved memory-efficient short-read <i>de novo</i> assembler
Ruibang Luo, Binghang Liu, Yinlong Xie et al. · GigaScience · 2012 · 5.6K citations · Full text
ABySS 2.0: resource-efficient assembly of large genomes using a Bloom filter
Shaun D. Jackman, Benjamin P. Vandervalk, Hamid Mohamadi et al. · Genome Research · 2017 · 740 citations · Full text
Time- and memory-efficient genome assembly with Raven
Robert Vaser, Mile Šikić · Nature Computational Science · 2021 · 499 citations
1–5 of 68
224
8
h-index
6
h-index
6
h-index
6
h-index
5
h-index
1–5 of 224
109
Canada's Michael Smith Genome Sciences Centre
Vancouver, Canada
6 h-index
36 publications
9K citations

École Normale Supérieure Paris-Saclay
Gif-sur-Yvette, France
4 h-index
4 publications
758 citations

Pennsylvania State University
State College, United States
4 h-index
11 publications
1K citations

University of Zagreb
Zagreb, Croatia
4 h-index
8 publications
1.3K citations
Agency for Science, Technology and Research
Singapore, Singapore
3 h-index
4 publications
664 citations

Wellcome Sanger Institute
Cambridge, United Kingdom
3 h-index
6 publications
2.6K citations

BC Cancer Agency
Vancouver, Canada
3 h-index
30 publications
565 citations
Genome Institute of Singapore
Singapore, Singapore
3 h-index
5 publications
1.2K citations
1–8 of 109
16 publications · 1.8K citations
14
h-index
7 publications · 672 citations
7
h-index
Repository · 5 publications · 162 citations
5
h-index
3 publications · 101 citations
3
h-index
3 publications · 287 citations
3
h-index
1–5