Concepedia

Mate-pair Repeat Resolution

Mate-Pair Repeat Resolution is a computational method in genome assembly that resolves repetitive DNA regions by leveraging the spatial constraints of mate-pair sequencing reads to distinguish between correct and spurious repeat alignments.

2

Publications

138

Citations

8

Authors

5

Institutions

Publications per year

2017–2026

0

Parents

Publications

2

1–2 of 2

Authors

8

  1. SP
    Son Pham

    University of California San Diego, United States

    1 publications · 81 citations

    1

    h-index

  2. JL
    Joshua L. Wetzel

    Princeton University, United States

    1 publications · 57 citations

    1

    h-index

  3. MC
    Mark Chaisson

    University of Southern California, United States

    1 publications · 81 citations

    1

    h-index

  4. CK
    Carl Kingsford

    Carnegie Mellon University, United States

    1 publications · 57 citations

    1

    h-index

  5. PM
    Paul Medvedev

    Pennsylvania State University, United States

    1 publications · 81 citations

    1

    h-index

1–5 of 8

Institutions

5

  1. Pacific Biosciences (United States)

    Menlo Park, United States

    1 h-index

    1 publications

    81 citations

  2. University of Maryland, College Park

    College Park, United States

    1 h-index

    3 publications

    171 citations

  3. University of California San Diego

    San Diego, United States

    1 h-index

    4 publications

    324 citations

  4. University of California System

    Oakland, United States

    1 h-index

    4 publications

    324 citations

  5. Princeton University

    Princeton, United States

    1 h-index

    1 publications

    57 citations

1–5 of 5

Venues

  1. BMC Bioinformatics

    1 publications · 57 citations

    1

    h-index

  2. Journal of Computational Biology

    1 publications · 81 citations

    1

    h-index

1–2