Graph Pruning
Graph Pruning is a computational technique in de Bruijn graph assembly that selectively removes low-coverage or erroneous branches and edges from the graph to reduce noise and improve contiguity while preserving biologically relevant assembly paths.
76
Publications
3.9K
Citations
249
Authors
128
Institutions
Publications per year
2017–2026
30
Parents
76
On graph query optimization in large networks
Peixiang Zhao, Jiawei Han · Proceedings of the VLDB Endowment · 2010 · 362 citations
A complete anytime algorithm for treewidth
Vibhav Gogate, Rina Dechter · 2004 · 142 citations
1–5 of 76
249
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 249
128

Centre National de la Recherche Scientifique
Paris, France
3 h-index
8 publications
308 citations

Lawrence Livermore National Laboratory
Livermore, United States
2 h-index
5 publications
87 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
2 publications
23 citations
Zhejiang University of Science and Technology
Hangzhou, China
2 h-index
3 publications
128 citations
Texas A&M University
College Station, United States
2 h-index
2 publications
40 citations
Huawei Technologies (China)
Shenzhen, China
2 h-index
3 publications
115 citations
University of Technology Sydney
Sydney, Australia
2 h-index
4 publications
167 citations
ETH Zurich
Zurich, Switzerland
2 h-index
5 publications
66 citations
1–8 of 128
PVLDB · 4 publications · 758 citations
4
h-index
Repository · 4 publications · 74 citations
4
h-index
3 publications · 135 citations
3
h-index
2 publications · 61 citations
2
h-index
2 publications · 23 citations
2
h-index
1–5