CoChat

Dali server: conservation mapping in 3D

Open access
Holm, Liisa, Rosenstr�m, P�ivi · 2010 · Nucleic Acids Research

The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.

Abstract

Our web site (http://ekhidna.biocenter.helsinki.fi/dali_server) runs the Dali program for protein structure comparison. The web site consists of three parts: (i) the Dali server compares newly solved structures against structures in the Protein Data Bank (PDB), (ii) the Dali database allows browsing precomputed structural neighbourhoods and (iii) the pairwise comparison generates suboptimal alignments for a pair of structures. Each part has its own query form and a common format for the results page. The inputs are either PDB identifiers or novel structures uploaded by the user. The results pages are hyperlinked to aid interactive analysis. The web interface is simple and easy to use. The key purpose of interactive analysis is to check whether conserved residues line up in multiple structural alignments and how conserved residues and ligands cluster together in multiple structure superimpositions. In favourable cases, protein structure comparison can lead to evolutionary discoveries not detected by sequence analysis.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1093/nar/gkq366

Cites

19 of 19 references verified0 citation errors · 0 not checkable

Statistics

Figures

Figure 1. The walking strategy focuses the search for structural neighbours to the neighbourhood of similar structures found so far. A sparse network of alignments within PDB is stored in an internal database. Once query Q is aligned to some PDB structure(s), a complete set of similar structures can be collected by walking, provided that the network is connected and similarity is approximately transitive.
Figure 1. The walking strategy focuses the search for structural neighbours to the neighbourhood of similar structures found so far. A sparse network of alignments within PDB is stored in an internal database. Once query Q is aligned to some PDB structure(s), a complete set of similar structures can be collected by walking, provided that the network is connected and similarity is approximately transitive.CC BY-NC · PubMed Central
Figure 2. Benchmarking the walking strategy. The plots show the distribution of AUC values for single-domain queries in scop 1.75. AUC, where coverage is TP/T and reliability is TP/P with T the number of members of a scop class, P number of matches above a given Z-score, and TP the number of members of a scop class above a given Z-score. Evaluated classes are scop folds (thin line), scop superfamilies (medium thick line) and scop families (thick line). Classes with fewer than 10 or more than 500 members are excluded. Query structures consisted of single domains from scop classes a-d, filtered at 90% sequence identity. Matches to all PDB structures which contained an instance of a domain in scop classes a-d were included in the evaluation.
Figure 2. Benchmarking the walking strategy. The plots show the distribution of AUC values for single-domain queries in scop 1.75. AUC, where coverage is TP/T and reliability is TP/P with T the number of members of a scop class, P number of matches above a given Z-score, and TP the number of members of a scop class above a given Z-score. Evaluated classes are scop folds (thin line), scop superfamilies (medium thick line) and scop families (thick line). Classes with fewer than 10 or more than 500 members are excluded. Query structures consisted of single domains from scop classes a-d, filtered at 90% sequence identity. Matches to all PDB structures which contained an instance of a domain in scop classes a-d were included in the evaluation.CC BY-NC · PubMed Central
Figure 3. Using 3kk7A as query, the Dali server produces several views of the result, including: match list (top left), sequence view (top right), secondary structure view (bottom right), mapping of structural conservation (bottom left) and mapping of sequence conservation (middle bottom). The match list is sorted by Z-scores. The sequence view uses colour for amino acids which have a frequency above 0.5 in a column. The secondary structure view displays the alignment of helices (H), strands (E) and loops (L) as defined by DSSP. Sequence and structural conservation is computed within the selected subset of matches; red positions are maximally conserved and blue positions are not conserved.
Figure 3. Using 3kk7A as query, the Dali server produces several views of the result, including: match list (top left), sequence view (top right), secondary structure view (bottom right), mapping of structural conservation (bottom left) and mapping of sequence conservation (middle bottom). The match list is sorted by Z-scores. The sequence view uses colour for amino acids which have a frequency above 0.5 in a column. The secondary structure view displays the alignment of helices (H), strands (E) and loops (L) as defined by DSSP. Sequence and structural conservation is computed within the selected subset of matches; red positions are maximally conserved and blue positions are not conserved.CC BY-NC · PubMed Central

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.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

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

Show all 19 references

Cited by

Items 1,001–1,051 of 1,051

Metadata

Authors
Holm, L., & Rosenstr�m, P.
Affiliations
University of Helsinki (FI)
Corresponding author
Holm, Liisa
Venue
Nucleic Acids Research
Published
2010-05-10
Volume
38
Issue
suppl_2
Pages
W545-W549
ISSN
  • 0305-1048 (ISSN-L)
  • 1362-4962
OpenAlex
W2030517878
Cited by
3,640
References
18
Citations by year
2026: 42 · 2025: 67 · 2024: 89 · 2023: 139 · 2022: 128 · 2021: 120 · 2020: 163 · 2019: 225 · 2018: 304 · 2017: 358 · 2016: 379 · 2015: 363 · 2014: 385 · 2013: 380 · 2012: 281
FWCI
113.03
Type
journal article
Language
en
Open access
Locations
  • Nucleic Acids Research (publishedVersion, cc-by-nc)
  • PubMed Central (publishedVersion, cc-by-nc)
  • PubMed (publishedVersion)
  • Työväentutkimus Vuosikirja (submittedVersion)
  • HighWire Press Open Archive (submittedVersion)
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Protein Structure and Dynamics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Structural Biology › Enzyme Structure and Function
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Genomics and Phylogenetic Studies
Keywords
protein structure comparison, structural alignment, conserved residues, ligand clustering, Protein Data Bank, web server
MeSH terms
Bacterial Proteins, Software, User-Computer Interface, Internet, Sequence Analysis, Protein, Databases, Protein, Structural Homology, Protein

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

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.