Assembly Ambiguity Resolution

Assembly Ambiguity Resolution is a computational method within short-read assembly that identifies and resolves conflicting alignments or branching paths in a de Bruijn graph by leveraging read-pair, read-depth, or sequence-context information to reconstruct the most biologically plausible contiguous sequences.

15

Publications

1.2K

Citations

59

Authors

32

Institutions

Publications per year

2017–2026

3

Authors

59

  1. TA
    Thomas A. Courtade

    University of California, Berkeley, United States

    2 publications · 114 citations

    2

    h-index

  2. IS
    Ilan Shomorony

    University of Illinois Urbana-Champaign, United States

    2 publications · 114 citations

    2

    h-index

  3. DT
    David Tse

    University of California, Berkeley, United States

    2 publications · 114 citations

    2

    h-index

  4. GM
    Govinda M. Kamath

    Stanford University, United States

    2 publications · 114 citations

    2

    h-index

  5. FX
    Fei Xia

    University of Washington, United States

    2 publications · 114 citations

    2

    h-index

1–5 of 59

Venues

  1. Bioinformatics

    3 publications · 149 citations

    3

    h-index

  2. Algorithms for Molecular Biology

    AMB · 2 publications · 401 citations

    2

    h-index

  3. Current Protocols in Bioinformatics

    1 publications · 227 citations

    1

    h-index

  4. PubMed

    Repository · 1 publications · 31 citations

    1

    h-index

  5. Genome Research

    GR · 1 publications · 104 citations

    1

    h-index

1–5