Demo Data from VLDB 2026 / reviewers in the wild / expert
Geraint Thomas
dblp:50/3950
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2005
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Interdisciplinary, comprehensive, and emerging computing
2 papers |
Bioinformatics and computational biology · 77% Computational science and engineering · 23% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › protein structure analysis › structural alignment
circular permutation detection |
0.1 | 1 | 2005 | Rapid motif-based prediction of circular permutations in multi-domain proteins · Bioinform. 2005 |
Computational science and engineering › numerical simulation
monte carlo simulation |
0.1 | 1 | 2005 | Density guided importance sampling: application to a reduced model of protein folding · Bioinform. 2005 |
Bioinformatics and computational biology › protein structure analysis
protein domain analysis |
0.1 | 1 | 2005 | Rapid motif-based prediction of circular permutations in multi-domain proteins · Bioinform. 2005 |
Bioinformatics and computational biology › protein structure prediction
protein folding |
0.1 | 1 | 2005 | Density guided importance sampling: application to a reduced model of protein folding · Bioinform. 2005 |
Bioinformatics and computational biology › molecular evolution
protein evolution |
0.0 | 1 | 2005 | Rapid motif-based prediction of circular permutations in multi-domain proteins · Bioinform. 2005 |
Methods — techniques the papers use, named apart from their topics
replica exchange · 0.1recursive alignment · 0.1hybrid monte carlo · 0.1domain string matching · 0.1density guided importance sampling · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2005 | Density guided importance sampling: application to a reduced model of protein foldingabstractMOTIVATION: Monte Carlo methods are the most effective means of exploring the energy landscapes of protein folding. The rugged topography of folding energy landscapes causes sampling inefficiencies however, particularly at low, physiological temperatures. RESULTS: A hybrid Monte Carlo method, termed density guided importance sampling (DGIS), is presented that overcomes these sampling inefficiencies. The method is shown to be highly accurate and efficient in determining Boltzmann weighted structural metrics of a discrete off-lattice protein model. In comparison to the Metropolis Monte Carlo method, and the hybrid Monte Carlo methods, jump-walking, smart-walking and replica-exchange, the DGIS method is shown to be more efficient, requiring no parameter optimization. The method guides the simulation towards under-sampled regions of the energy spectrum and recognizes when equilibrium has been reached, avoiding arbitrary and excessively long simulation times. AVAILABILITY: Fortran code available from authors upon request. CONTACT: [email protected]. Geraint Thomas, Richard B. Sessions, Martin J. Parker |
Bioinform. | 1 |
| 2005 | Rapid motif-based prediction of circular permutations in multi-domain proteinsabstractAbstract Motivation: Rearrangements of protein domains and motifs such as swaps and circular permutations (CPs) can produce erroneous results in searching sequence databases when using traditional methods based on linear sequence alignments. Circular permutations are also of biological relevance because they can help to better understand both protein evolution and functionality. Results: We have developed an algorithm, RASPODOM, which is based on the classical recursive alignment scheme. Sequences are represented as strings of domains taken from precompiled resources of domain (motif) databases such as ProDom. The algorithm works several orders of magnitude faster than a reimplementation of the existing CP detection algorithm working on strings of amino acids, produces virtually no false positives and allows the discrimination of true CPs from ‘intermediate’ CPs (iCPs). Several true CPs which have not been reported in literature so far could be identified from Swiss-Prot/TrEMBL within minutes. Availability: Source codes, additional scripts, data and a web-based interface can be found on: http://www.uni-muenster.de/Biologie.Botanik/ebb/projects/raspodom/ Contact: [email protected] January 3rd Weiner, Geraint Thomas, Erich Bornberg-Bauer |
Bioinform. | 2 |