A Comprehensive Evaluation of Generalizability of Deep Learning-Based Hi-C Resolution Improvement Methods by Ghulam Murtaza, Atishay Jain, Madeline Hughes, Justin Wagner, Ritambhara Singh

“…We present our framework—Hi-CY—that compares existing Hi-C resolution upscaling methods on seven experimentally generated low-resolution Hi-C datasets belonging to various levels of read sparsities originating from three cell lines on a comprehensive set of evaluation metrics. …”
Get full text

Tight Hardness for Shortest Cycles and Paths in Sparse Graphs by Lincoln, Andrea I, Williams, Virginia Vassilevska, Williams, Richard Ryan

“…Starting from the hypothesis that the minimum weight (2ℓ+ 1)-Clique problem in edge weighted graphs requires n2ℓ+1-o(1) time, we prove that for all sparsities of the form m = Q(n1+1/ℓ), there is no O(n2 +mn1-ϵ ) time algorithm for e > 0 for any of the below problems Minimum Weight (2ℓ + 1)-Cycle in a directed weighted graph, Shortest Cycle in a directed weighted graph, APSP in a directed or undirected weighted graph, Radius (or Eccentricities) in a directed or undirected weighted graph, Wiener index of a directed or undirected weighted graph, Replacement Paths in a directed weighted graph, Second Shortest Path in a directed weighted graph, Betweenness Centrality of a given node in a directed weighted graph. …”
Get full text

Compressive super-localization by Liu, Yi, Ph. D. Massachusetts Institute of Technology

Get full text