output
20102026
most citedDirect-coupling analysis of residue co-evolution captures native contacts across many protein families

1.6k citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing cs.DSShow all

4 papers · 1 filter

cs.DS2023★ 42 cited

A Survey on the Densest Subgraph Problem and Its Variants

Tommaso Lanciano, Atsushi Miyauchi, Adriano Fazzone +1

The Densest Subgraph Problem requires to find, in a given graph, a subset of vertices whose induced subgraph maximizes a measure of density. The problem has received a great deal o…

cs.DS2017★ 2 cited

The cavity approach for Steiner trees packing problems

Alfredo Braunstein, Anna Paola Muntoni

The Belief Propagation approximation, or cavity method, has been recently applied to several combinatorial optimization problems in its zero-temperature implementation, the max-sum…

cs.DS2016★ 1 cited

Practical optimization of Steiner Trees via the cavity method

Alfredo Braunstein, Anna Muntoni

The optimization version of the cavity method for single instances, called Max-Sum, has been applied in the past to the Minimum Steiner Tree Problem on Graphs and variants. Max-Sum…

cs.DS2013★ 17 cited

On the performance of a cavity method based algorithm for the Prize-Collecting Steiner Tree Problem on graphs

Indaco Biazzo, Alfredo Braunstein, Riccardo Zecchina

We study the behavior of an algorithm derived from the cavity method for the Prize-Collecting Steiner Tree (PCST) problem on graphs. The algorithm is based on the zero temperature…