Graph Pruning

Graph Pruning is a computational technique in de Bruijn graph assembly that selectively removes low-coverage or erroneous branches and edges from the graph to reduce noise and improve contiguity while preserving biologically relevant assembly paths.

76

Publications

3.9K

Citations

249

Authors

128

Institutions

Publications per year

2017–2026

30

Authors

249

  1. NT
    Nicolas Tripoul

    Lawrence Livermore National Laboratory, United States

    2 publications · 36 citations

    2

    h-index

  2. MR
    Matei Ripeanu

    University of British Columbia, Canada

    2 publications · 36 citations

    2

    h-index

  3. AG
    Alban Grastien

    Australian National University, Australia

    2 publications · 479 citations

    2

    h-index

  4. AH
    Assefaw H. Gebremedhin

    Washington State University, United States

    2 publications · 118 citations

    2

    h-index

  5. GS
    Geoffrey Sanders

    Lawrence Livermore National Laboratory, United States

    2 publications · 36 citations

    2

    h-index

1–5 of 249

Venues

  1. Proceedings of the VLDB Endowment

    PVLDB · 4 publications · 758 citations

    4

    h-index

  2. arXiv (Cornell University)

    Repository · 4 publications · 74 citations

    4

    h-index

  3. Networks

    3 publications · 135 citations

    3

    h-index

  4. 2

    h-index

  5. Discrete Mathematics

    2 publications · 23 citations

    2

    h-index

1–5