default search action
Martin Weigt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j15]Simone Ciarella
, Jeanne Trinquier, Martin Weigt
Machine-learning-assisted Monte Carlo fails at sampling computationally hard problems. Mach. Learn. Sci. Technol. 4(1): 10501 (2023) - [j14]Carlos A. Gandarilla-Pérez, Sergio Pinilla, Anne-Florence Bitbol
Combining phylogeny and coevolution improves the inference of interaction partners among paralogous proteins. PLoS Comput. Biol. 19(3) (2023) - 2021
- [j13]Anna Paola Muntoni
adabmDCA: adaptive Boltzmann machine learning for biological sequences. BMC Bioinform. 22(3): 528 (2021) - [j12]Edwin Rodriguez Horta
On the effect of phylogenetic correlations in coevolution-based contact prediction in proteins. PLoS Comput. Biol. 17(5) (2021) - 2020
- [j11]Maureen Muscat
FilterDCA: Interpretable supervised contact prediction using inter-domain coevolution. PLoS Comput. Biol. 16(10) (2020) - [p2]Thomas Gueudré, Carlo Baldassi, Andrea Pagnani, Martin Weigt
Predicting Interacting Protein Pairs by Coevolutionary Paralog Matching. Protein-Protein Interaction Networks 2020: 57-65 - [i14]Pierre Barrat-Charlaix, Anna Paola Muntoni, Kai Shimagaki, Martin Weigt, Francesco Zamponi:
Sparse generative modeling of protein-sequence families. CoRR abs/2011.11259 (2020)
2010 – 2019
- 2019
- [j10]Edwin Rodriguez Horta
Toward Inferring Potts Models for Phylogenetically Correlated Sequence Data. Entropy 21(11): 1090 (2019) - [j9]Giancarlo Croce
A multi-scale coevolutionary approach to predict interactions between protein domains. PLoS Comput. Biol. 15(10) (2019) - [j8]Guillaume Marmier, Martin Weigt
Phylogenetic correlations can suffice to infer protein partners from sequences. PLoS Comput. Biol. 15(10) (2019) - 2018
- [j7]Nika Abdollahi, Alexandre Albani, Éric Anthony, Agnes Baud, Mélissa Cardon, Robert Clerc, Dariusz Czernecki, Romain Conte
Meet-U: Educating through research immersion. PLoS Comput. Biol. 14(3) (2018) - 2013
- [j6]Simona Cocco
From Principal Component to Direct Coupling Analysis of Coevolution in Proteins: Low-Eigenvalue Modes are Needed for Structure Prediction. PLoS Comput. Biol. 9(8) (2013) - [j5]Evan J. Molinelli, Anil Korkut, Weiqing Wang, Martin L. Miller
Perturbation Biology: Inferring Signaling Networks in Cellular Systems. PLoS Comput. Biol. 9(12) (2013) - 2010
- [j4]Marc Bailly-Bechet
Inference of sparse combinatorial-control networks from gene-expression data: a message passing approach. BMC Bioinform. 11: 355 (2010)
2000 – 2009
- 2009
- [c1]Alejandro Lage-Castellanos, Andrea Pagnani
The importance of dilution in the inference of biological networks. Allerton 2009: 531-538 - [i13]S. Bradde, Alfredo Braunstein, H. Mahmoudi, F. Tria, Martin Weigt, Riccardo Zecchina:
Aligning graphs and finding substructures by message passing. CoRR abs/0905.1893 (2009) - 2007
- [j3]Michele Leone, Sumedha, Martin Weigt
Clustering by soft-constraint affinity propagation: applications to gene-expression data. Bioinform. 23(20): 2708-2715 (2007) - 2006
- [p1]Alfredo Braunstein, Marc Mézard, Martin Weigt, Riccardo Zecchina:
Constraint Satisfaction by Survey Propagation. Computational Complexity and Statistical Physics 2006: 107-124 - [i12]Martin Weigt, Haijun Zhou:
Message passing for vertex covers. CoRR abs/cond-mat/0605190 (2006) - 2005
- [j2]Alexander K. Hartmann, Wolfgang Barthel, Martin Weigt
Phase transition and finite-size scaling in the vertex-cover problem. Comput. Phys. Commun. 169(1-3): 234-237 (2005) - 2004
- [i11]Florent Krzakala, Andrea Pagnani, Martin Weigt:
Threshold values, stability analysis and high-q asymptotics for the coloring problem on random graphs. CoRR cond-mat/0403725 (2004) - 2003
- [i10]Wolfgang Barthel, Alexander K. Hartmann, Martin Weigt:
Solving satisfiability problems by fluctuations: The dynamics of stochastic local search algorithms. CoRR cond-mat/0301271 (2003) - 2002
- [i9]Alexei Vázquez, Martin Weigt:
Computational complexity arising from degree correlations in networks. CoRR cond-mat/0207035 (2002) - [i8]Roberto Mulet, Andrea Pagnani, Martin Weigt, Riccardo Zecchina:
Coloring random graphs. CoRR cond-mat/0208460 (2002) - [i7]Alfredo Braunstein, Marc Mézard, Martin Weigt, Riccardo Zecchina:
Constraint Satisfaction by Survey Propagation. CoRR cond-mat/0212451 (2002) - 2001
- [j1]Alexander K. Hartmann, Martin Weigt
Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs. Theor. Comput. Sci. 265(1-2): 199-225 (2001) - [i6]Wolfgang Barthel, Alexander K. Hartmann, Michele Leone, Federico Ricci-Tersenghi, Martin Weigt, Riccardo Zecchina:
Hiding solutions in random satisfiability problems: A statistical mechanics approach. CoRR cond-mat/0111153 (2001) - 2000
- [i5]Martin Weigt, Alexander K. Hartmann:
The number of guards needed by a museum: A phase transition in vertex covering of random graphs. CoRR cond-mat/0001137 (2000) - [i4]Alexander K. Hartmann, Martin Weigt:
Statistical mechanics perspective on the phase transition in vertex covering finite-connectivity random graphs. CoRR cond-mat/0006316 (2000) - [i3]Martin Weigt, Alexander K. Hartmann:
Typical solution time for a vertex-covering algorithm on finite-connectivity random graphs. CoRR cond-mat/0009417 (2000) - [i2]Federico Ricci-Tersenghi, Martin Weigt, Riccardo Zecchina:
Simplest random K-satisfiability problem. CoRR cond-mat/0011181 (2000)
1990 – 1999
- 1999
- [i1]Giulio Biroli, Rémi Monasson, Martin Weigt:
A variational description of the ground state structure in random satisfiability problems. CoRR cond-mat/9907343 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: