Scientists Found a Surprisingly Simple Way To Improve Online Matchmaking

A new study suggests that a simple change to how online matchmaking platforms display profiles can significantly improve user ...
Tech Xplore

Generative AI designs DNA origami to match user-drawn shapes automatically

A joint research team has developed an automated design technology that enables the creation of DNA origami structures that ...
C&EN

Algorithm-Assisted Structure Identification of Individual Nucleobases in Single DNA Chains through Tip-Enhanced Raman Spectromicroscopy

Hefei National Research Center for Physical Sciences at the Microscale and CAS Center for Excellence in Quantum Information and Quantum Physics, University of Science and Technology of China, Hefei, ...
IEEE

Explainable Neural Subgraph Matching With Learnable Multi-Hop Attention

Abstract: Subgraph matching is a challenging problem with a wide range of applications in drug discovery, social network analysis, biochemistry, and cognitive science. It involves determining whether ...
acm.org

Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow

Download PDF Join the Discussion View in the ACM Digital Library The maximum flow problem and its generalization, the minimum-cost flow problem, are classic combinatorial graph problems that find ...
IEEE

A Generalized Community-Structure-Aware Optimization Framework for Efficient Subgraph Matching in Social Network Analysis

Abstract: Subgraph matching is a common and important query for analyzing social networks. However, existing subgraph matching algorithms are still unsatisfactory in efficiency. As different subgraph ...
PNAS

Two provably consistent divide-and-conquer clustering algorithms for large networks

In this paper, we present two divide-and-conquer algorithms for clustering large graphs. Both algorithms apply a base algorithm on several small subgraphs and then use these individual local ...