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
189
Tao Wen, Penghao Xie, Shengdie Yang et al. · iMeta · 2022 · 442 citations · Full text
Benjamin B. Bederson, Ben Shneiderman, Martin Wattenberg · ACM Transactions on Graphics · 2002 · 425 citations
The Backboard Wiring Problem: A Placement Algorithm
Leon Steinberg · SIAM Review · 1961 · 381 citations
1–5 of 189
520
6
h-index
University of Illinois Urbana-Champaign, United States
5 publications · 203 citations
5
h-index
3
h-index
3
h-index
Alexander Fleming Biomedical Sciences Research Center, Greece
3 publications · 159 citations
3
h-index
1–5 of 520
240
University of Maryland, College Park
College Park, United States
6 h-index
15 publications
1.6K citations
The University of Texas at Austin
Austin, United States
6 h-index
10 publications
240 citations
University of Kaiserslautern
Kaiserslautern, Germany
4 h-index
10 publications
283 citations
University of Konstanz
Konstanz, Germany
4 h-index
6 publications
465 citations
University of Illinois Urbana-Champaign
Urbana, United States
4 h-index
13 publications
476 citations
University of Washington
Seattle, United States
4 h-index
6 publications
404 citations

Centre National de la Recherche Scientifique
Paris, France
4 h-index
10 publications
179 citations
University of Arizona
Tucson, United States
4 h-index
5 publications
150 citations
1–8 of 240
TVCG · 12 publications · 798 citations
12
h-index
8 publications · 615 citations
8
h-index
JGAA · 6 publications · 308 citations
6
h-index
4 publications · 290 citations
4
h-index
4 publications · 202 citations
4
h-index
1–5