SuperLooper--a prediction server for the modeling of loops in globular and membrane proteins
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
SuperLooper provides the first online interface for the automatic, quick and interactive search and placement of loops in proteins (LIP). A database containing half a billion segments of water-soluble proteins with lengths up to 35 residues can be screened for candidate loops. A specified database containing 180,000 membrane loops in proteins (LIMP) can be searched, alternatively. Loop candidates are scored based on sequence criteria and the root mean square deviation (RMSD) of the stem atoms. Searching LIP, the average global RMSD of the respective top-ranked loops to the original loops is benchmarked to be <2 A, for loops up to six residues or <3 A for loops shorter than 10 residues. Other suitable conformations may be selected and directly visualized on the web server from a top-50 list. For user guidance, the sequence homology between the template and the original sequence, proline or glycine exchanges or close contacts between a loop candidate and the remainder of the protein are denoted. For membrane proteins, the expansions of the lipid bilayer are automatically modeled using the TMDET algorithm. This allows the user to select the optimal membrane protein loop concerning its relative orientation to the lipid bilayer. The server is online since October 2007 and can be freely accessed at URL: http://bioinformatics.charite.de/superlooper/.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Crystal structure of opsin in its G-protein-interacting conformation
Scheerer, P., Park, J. H., Hildebrand, P. W., Kim, Y. J., Krauß, N., Choe, H.-W., Hofmann, K. P., & Ernst, O. P. (2008) · Nature · doi:10.1038/nature07330 · Cited by 1,059 · cited 1×
“Medically highly relevant interactions, such as the coupling of receptors to G proteins are mediated by membrane protein loops (19).”
BackgroundSelf-citation
Cited by
Cloud-based simulations on Google Exacycle reveal ligand modulation of GPCR activation pathways
Kohlhoff, K. J., Shukla, D., Lawrenz, M., Bowman, G. R., Konerding, D. E., Belov, D., Altman, R. B., & Pande, V. S. (2014) · Nature Chemistry · doi:10.1038/nchem.1821 · Cited by 416
FREAD revisited: accurate loop structure prediction using a database search algorithm
Choi, Y., & Deane, C. M. (2010) · Proteins Structure Function and Bioinformatics · doi:10.1002/prot.22658 · Cited by 161
Direct protein-lipid interactions shape the conformational landscape of secondary transporters
Martens, C., Shekhar, M., Borysik, A. J., Lau, A. M., Reading, E., Tajkhorshid, E., Booth, P. J., & Politis, A. (2018) · Nature Communications · doi:10.1038/s41467-018-06704-1 · Cited by 134
Antibody H3 structure prediction
Marks, C., & Deane, C. M. (2017) · Computational and Structural Biotechnology Journal · doi:10.1016/j.csbj.2017.01.010 · Cited by 56
“Examples of this type of algorithm include FREAD [35,37], SuperLooper [38], LoopWeaver [39] and LoopIng [40].”
MethodSphinx: merging knowledge-based and ab initio approaches to improve protein loop prediction
Marks, C., Nowak, J., Klostermann, S., Georges, G., Dunbar, J., Shi, J., Kelm, S., & Deane, C. M. (2017) · Bioinformatics · doi:10.1093/bioinformatics/btw823 · Cited by 56
Metadata
- Authors
- Hildebrand, P. W., Goede, A., Bauer, R. A., Gruening, B., Ismer, J., Michalsky, E., & Preissner, R.
- Venue
- Nucleic Acids Research
- Publisher
- Oxford University Press (OUP)
- Published
- 2009-05-08
- Volume
- 37
- Issue
- Web Server
- Pages
- W571-W574
- ISSN
- 0305-1048 (ISSN-L)
- 1362-4962
- OpenAlex
- W2085144661
- Cited by
- 96
- References
- 1
- FWCI
- 3.24
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: SuperLooper--a prediction server for the modeling of loops in globular and membrane proteins. https://app.cochat.ai/papers/10.1093/nar/gkp338
- The paper
- Hildebrand, P. W., Goede, A., Bauer, R. A., Gruening, B., Ismer, J., Michalsky, E., & Preissner, R. (2009). SuperLooper--a prediction server for the modeling of loops in globular and membrane proteins. Nucleic Acids Research. https://doi.org/10.1093/nar/gkp338
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.