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
Parents
24
Exploiting sparseness in de novo genome assembly
Chengxi Ye, Zhanshan Sam, Charles H. Cannon et al. · BMC Bioinformatics · 2012 · 428 citations · Full text
Erik Garrison, Andrea Guarracino · Bioinformatics · 2022 · 85 citations · Full text
1–5 of 24
145
3
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 145
87
Stony Brook University
Stony Brook, United States
3 h-index
10 publications
378 citations
University of Maryland, College Park
College Park, United States
3 h-index
3 publications
893 citations
Michigan State University
East Lansing, United States
2 h-index
21 publications
8.5K citations

University of Oslo
Oslo, Norway
2 h-index
2 publications
443 citations
Argonne National Laboratory
Lemont, United States
2 h-index
4 publications
466 citations
University of Tennessee Health Science Center
Memphis, United States
2 h-index
2 publications
106 citations
Human Technopole
Milan, Italy
2 h-index
2 publications
106 citations

University of Helsinki
Helsinki, Finland
2 h-index
4 publications
72 citations
1–8 of 87
4 publications · 600 citations
4
h-index
3 publications · 141 citations
3
h-index
Repository · 2 publications · 71 citations
2
h-index
2 publications · 40 citations
2
h-index
1 publications · 424 citations
1
h-index
1–5