Martin Weigt

Orcid: 0000-0002-0492-3684

According to our database1, Martin Weigt authored at least 31 papers between 1999 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Combining phylogeny and coevolution improves the inference of interaction partners among paralogous proteins.
PLoS Comput. Biol., March, 2023

Machine-learning-assisted Monte Carlo fails at sampling computationally hard problems.
Mach. Learn. Sci. Technol., March, 2023

2021
On the effect of phylogenetic correlations in coevolution-based contact prediction in proteins.
PLoS Comput. Biol., 2021

adabmDCA: adaptive Boltzmann machine learning for biological sequences.
BMC Bioinform., 2021

2020
Predicting Interacting Protein Pairs by Coevolutionary Paralog Matching.
Proceedings of the Protein-Protein Interaction Networks, Methods and Protocols., 2020

FilterDCA: Interpretable supervised contact prediction using inter-domain coevolution.
PLoS Comput. Biol., 2020

Sparse generative modeling of protein-sequence families.
CoRR, 2020

2019
Phylogenetic correlations can suffice to infer protein partners from sequences.
PLoS Comput. Biol., 2019

A multi-scale coevolutionary approach to predict interactions between protein domains.
PLoS Comput. Biol., 2019

Toward Inferring Potts Models for Phylogenetically Correlated Sequence Data.
Entropy, 2019

2018
Meet-U: Educating through research immersion.
PLoS Comput. Biol., 2018

2013
Perturbation Biology: Inferring Signaling Networks in Cellular Systems.
PLoS Comput. Biol., 2013

From Principal Component to Direct Coupling Analysis of Coevolution in Proteins: Low-Eigenvalue Modes are Needed for Structure Prediction.
PLoS Comput. Biol., 2013

2010
Inference of sparse combinatorial-control networks from gene-expression data: a message passing approach.
BMC Bioinform., 2010

2009
Aligning graphs and finding substructures by message passing
CoRR, 2009

The importance of dilution in the inference of biological networks.
Proceedings of the 47th Annual Allerton Conference on Communication, 2009

2007
Clustering by soft-constraint affinity propagation: applications to gene-expression data.
Bioinform., 2007

2006
Message passing for vertex covers
CoRR, 2006

Constraint Satisfaction by Survey Propagation.
Proceedings of the Computational Complexity and Statistical Physics., 2006

2005
Phase transition and finite-size scaling in the vertex-cover problem.
Comput. Phys. Commun., 2005

2004
Threshold values, stability analysis and high-q asymptotics for the coloring problem on random graphs
CoRR, 2004

2003
Solving satisfiability problems by fluctuations: The dynamics of stochastic local search algorithms
CoRR, 2003

2002
Constraint Satisfaction by Survey Propagation
CoRR, 2002

Coloring random graphs
CoRR, 2002

Computational complexity arising from degree correlations in networks
CoRR, 2002

2001
Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs.
Theor. Comput. Sci., 2001

Hiding solutions in random satisfiability problems: A statistical mechanics approach
CoRR, 2001

2000
Simplest random K-satisfiability problem
CoRR, 2000

Typical solution time for a vertex-covering algorithm on finite-connectivity random graphs
CoRR, 2000

The number of guards needed by a museum: A phase transition in vertex covering of random graphs
CoRR, 2000

1999
A variational description of the ground state structure in random satisfiability problems
CoRR, 1999


  Loading...