Path Enumeration
Path Enumeration is a computational method in the context of De Bruijn Graph Assembly that systematically identifies and lists all possible traversal routes through graph nodes representing k-mers, distinguishing itself by explicitly reconstructing potential sequence paths from overlapping reads to resolve assembly ambiguities.
198
Publications
9.7K
Citations
380
Authors
235
Institutions
Publications per year
2017–2026
32
Parents
198
1–5 of 198
380
4
h-index
4
h-index
3
h-index
Volpe National Transportation Systems Center, United States
3 publications · 914 citations
3
h-index
3
h-index
1–5 of 380
235
National University of Singapore
Singapore, Singapore
6 h-index
16 publications
304 citations
Princeton University
Princeton, United States
5 h-index
8 publications
1.2K citations

Indian Institute of Technology Roorkee
Roorkee, India
4 h-index
6 publications
83 citations

UNSW Sydney
Sydney, Australia
4 h-index
10 publications
298 citations
University of Vienna
Vienna, Austria
3 h-index
3 publications
78 citations

University of Waterloo
Waterloo, Canada
3 h-index
4 publications
97 citations

The University of Melbourne
Melbourne, Australia
3 h-index
5 publications
246 citations

Tohoku University
Sendai, Japan
3 h-index
5 publications
176 citations
1–8 of 235
18 publications · 795 citations
13
h-index
7 publications · 397 citations
7
h-index
7 publications · 221 citations
7
h-index
TRR · 6 publications · 358 citations
6
h-index
Repository · 6 publications · 117 citations
6
h-index
1–5