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

Authors

224

  1. RC
    Rayan Chikhi

    Centre National de la Recherche Scientifique, France

    8 publications · 991 citations

    8

    h-index

  2. SD
    Shaun D. Jackman

    Canada's Michael Smith Genome Sciences Centre, Canada

    6 publications · 888 citations

    6

    h-index

  3. RL
    René L. Warren

    Canada's Michael Smith Genome Sciences Centre, Canada

    6 publications · 879 citations

    6

    h-index

  4. İB
    İnanç Birol

    Canada's Michael Smith Genome Sciences Centre, Canada

    6 publications · 879 citations

    6

    h-index

  5. JC
    Justin Chu

    Canada's Michael Smith Genome Sciences Centre, Canada

    5 publications · 840 citations

    5

    h-index

1–5 of 224

Venues

  1. Bioinformatics

    16 publications · 1.8K citations

    14

    h-index

  2. BMC Bioinformatics

    7 publications · 672 citations

    7

    h-index

  3. bioRxiv (Cold Spring Harbor Laboratory)

    Repository · 5 publications · 162 citations

    5

    h-index

  4. 3

    h-index

  5. PLoS ONE

    3 publications · 287 citations

    3

    h-index

1–5