Layout Algorithms

Layout Algorithms is a computational method within the field of genome assembly that organizes overlapping sequence reads into a coherent structure by determining their relative positions and orientations based on pairwise overlaps, thereby enabling the reconstruction of the original DNA sequence.

189

Publications

11K

Citations

520

Authors

240

Institutions

Publications per year

2017–2026

30

Authors

520

  1. HC
    Helen C. Purchase

    University of Glasgow, United Kingdom

    6 publications · 422 citations

    6

    h-index

  2. MD
    Martin D. F. Wong

    University of Illinois Urbana-Champaign, United States

    5 publications · 203 citations

    5

    h-index

  3. SR
    Sherief Reda

    Brown University, United States

    3 publications · 71 citations

    3

    h-index

  4. ER
    Emden R. Gansner

    AT&T (United States), United States

    3 publications · 2K citations

    3

    h-index

  5. GA
    Georgios A. Pavlopoulos

    Alexander Fleming Biomedical Sciences Research Center, Greece

    3 publications · 159 citations

    3

    h-index

1–5 of 520

Venues

  1. IEEE Transactions on Visualization and Computer Graphics

    TVCG · 12 publications · 798 citations

    12

    h-index

  2. Bioinformatics

    8 publications · 615 citations

    8

    h-index

  3. Journal of Graph Algorithms and Applications

    JGAA · 6 publications · 308 citations

    6

    h-index

  4. Computer Graphics Forum

    4 publications · 290 citations

    4

    h-index

  5. 4

    h-index

1–5