K-mer Graph Construction

k-Mer Graph Construction is a computational method in sequence assembly that belongs to the class of graph-based genome reconstruction techniques, distinguished by its specific use of fixed-length nucleotide subsequences (k-mers) as nodes and their overlaps as directed edges to represent the topological structure of sequencing reads.

24

Publications

1.9K

Citations

145

Authors

87

Institutions

Publications per year

2017–2026

11

Authors

145

  1. PP
    Prashant Pandey

    Stony Brook University, United States

    3 publications · 112 citations

    3

    h-index

  2. RP
    Rob Patro

    Stony Brook University, United States

    3 publications · 112 citations

    3

    h-index

  3. CB
    Christina Boucher

    University of Florida, United States

    2 publications · 27 citations

    2

    h-index

  4. EG
    Erik Garrison

    University of California, Santa Cruz, United States

    2 publications · 106 citations

    2

    h-index

  5. EM
    Eric McDonald

    Michigan State University, United States

    2 publications · 443 citations

    2

    h-index

1–5 of 145

Venues

  1. BMC Bioinformatics

    4 publications · 600 citations

    4

    h-index

  2. Bioinformatics

    3 publications · 141 citations

    3

    h-index

  3. bioRxiv (Cold Spring Harbor Laboratory)

    Repository · 2 publications · 71 citations

    2

    h-index

  4. Scientific Reports

    2 publications · 40 citations

    2

    h-index

  5. F1000Research

    1 publications · 424 citations

    1

    h-index

1–5