Graph Cleaning
Graph Cleaning is a computational preprocessing method within string graph assembly that refines the topology of an overlap graph by removing spurious edges and redundant paths to improve the accuracy of downstream genome reconstruction.
12
Publications
535
Citations
43
Authors
20
Institutions
Publications per year
2017–2026
4
Parents
12
An efficient implementation of the algorithm 'CLEAN'
B. G. Clark · 1980 · 156 citations
gbase: an efficient analysis platform for large graphs
U Kang, Hanghang Tong, Jimeng Sun et al. · The VLDB Journal · 2012 · 69 citations
EXACT AND HEURISTIC ALGORITHMS FOR WEIGHTED CLUSTER EDITING
Sven Rahmann, Tobias Wittkop, Jan Baumbach et al. · Computational Systems Bioinformatics · 2007 · 67 citations
1–5 of 12
43
2
h-index
Hong Kong University of Science and Technology, Hong Kong SAR China
2 publications · 43 citations
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 43
20

Beijing Institute of Technology
Beijing, China
2 h-index
7 publications
122 citations

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
2 h-index
2 publications
43 citations

BGI Group (China)
Shenzhen, China
1 h-index
1 publications
38 citations
University of Newcastle Australia
Newcastle, Australia
1 h-index
1 publications
21 citations
Bielefeld University
Bielefeld, Germany
1 h-index
4 publications
268 citations

Alibaba Group (China)
Hangzhou, China
1 h-index
4 publications
216 citations

Northeastern University
Shenyang, China
1 h-index
1 publications
31 citations
Argonne National Laboratory
Lemont, United States
1 h-index
1 publications
38 citations
1–8 of 20
1 publications · 69 citations
1
h-index
Conference · 1 publications · 67 citations
1
h-index
Conference · 1 publications · 54 citations
1
h-index
1 publications · 38 citations
1
h-index
1 publications · 22 citations
1
h-index
1–5