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

Authors

380

  1. YS
    Yau-Tsun Steven Li

    Princeton University, United States

    4 publications · 567 citations

    4

    h-index

  2. SM
    Sharad Malik

    Princeton University, United States

    4 publications · 668 citations

    4

    h-index

  3. JL
    Jósé L. Ramírez

    Universidad Nacional de Colombia, Colombia

    3 publications · 37 citations

    3

    h-index

  4. RB
    Robert B. Dial

    Volpe National Transportation Systems Center, United States

    3 publications · 914 citations

    3

    h-index

  5. EC
    Ennio Cascetta

    University of Naples Federico II, Italy

    3 publications · 507 citations

    3

    h-index

1–5 of 380

Venues

  1. Discrete Mathematics

    18 publications · 795 citations

    13

    h-index

  2. Journal of Combinatorial Theory Series A

    7 publications · 397 citations

    7

    h-index

  3. Microelectronics Reliability

    7 publications · 221 citations

    7

    h-index

  4. 6

    h-index

  5. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 6 publications · 117 citations

    6

    h-index

1–5