String Graph Assembly is a genome assembly method that constructs a contiguous sequence from overlapping reads by representing them as nodes and their overlaps as edges in a directed graph, from which redundant paths are resolved to produce a minimal, non-redundant sequence reconstruction.
18
Publications
2.4K
Citations
47
Authors
23
Institutions
Publications per year
2017–2026
2
Publications
18
Integrating long-range connectivity information into de Bruijn graphs
Isaac Turner, Kiran Garimella, Zamin Iqbal et al. · Bioinformatics · 2018 · 75 citations · Full text
1–5 of 18
Authors
47
- RR
2
h-index
- JH
2
h-index
- YC
2
h-index
- RL
2
h-index
- TL
2
h-index
1–5 of 47
Institutions
23
Institute of Information Science, Academia Sinica
Taipei, Taiwan
2 h-index
8 publications
200 citations
Wellcome Sanger Institute
Cambridge, United Kingdom
2 h-index
4 publications
2.2K citations
University of Hong Kong
Pok Fu Lam, Hong Kong
2 h-index
9 publications
140 citations
University of Milano-Bicocca
Milan, Italy
2 h-index
10 publications
135 citations
National Taiwan University
Taipei, Taiwan
2 h-index
4 publications
100 citations
University of California, Berkeley
Berkeley, United States
1 h-index
4 publications
44 citations
University of Oxford
Oxford, United Kingdom
1 h-index
4 publications
300 citations
HAW Hamburg
Hamburg, Germany
1 h-index
2 publications
122 citations
1–8 of 23
Venues
- Bioinformatics
4 publications · 778 citations
4
h-index
- Journal of Computational Biology
3 publications · 80 citations
3
h-index
- BMC Genomics
2 publications · 52 citations
2
h-index
- arXiv (Cornell University)
Repository · 1 publications · 28 citations
1
h-index
- Genome Research
GR · 1 publications · 817 citations
1
h-index
1–5