145
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Dali server: conservation mapping in 3D

      research-article
      1 , 2 , * , 1
      Nucleic Acids Research
      Oxford University Press

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          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.

          Related collections

          Most cited references15

          • Record: found
          • Abstract: found
          • Article: found
          Is Open Access

          Data growth and its impact on the SCOP database: new developments

          The Structural Classification of Proteins (SCOP) database is a comprehensive ordering of all proteins of known structure, according to their evolutionary and structural relationships. The SCOP hierarchy comprises the following levels: Species, Protein, Family, Superfamily, Fold and Class. While keeping the original classification scheme intact, we have changed the production of SCOP in order to cope with a rapid growth of new structural data and to facilitate the discovery of new protein relationships. We describe ongoing developments and new features implemented in SCOP. A new update protocol supports batch classification of new protein structures by their detected relationships at Family and Superfamily levels in contrast to our previous sequential handling of new structural data by release date. We introduce pre-SCOP, a preview of the SCOP developmental version that enables earlier access to the information on new relationships. We also discuss the impact of worldwide Structural Genomics initiatives, which are producing new protein structures at an increasing rate, on the rates of discovery and growth of protein families and superfamilies. SCOP can be accessed at http://scop.mrc-lmb.cam.ac.uk/scop.
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Dali: a network tool for protein structure comparison.

              Bookmark
              • Record: found
              • Abstract: found
              • Article: not found

              Surprising similarities in structure comparison.

              Examination of a protein's structural 'neighbors' can reveal distant evolutionary relationships that are otherwise undetectable, and perhaps suggest unsuspected functional properties. In the past, such analyses have often required specialized software and computer skills, but new structural comparison methods, developed in the past two years, increasingly offer this opportunity to structural and molecular biologists in general. These methods are based on similarity-search algorithms that are fast enough to have effectively removed the computer-time limitation for structure-structure search and alignment, and have made it possible for several groups to conduct systematic comparisons of all publicly available structures, and offer this information via the World Wide Web. Furthermore, and perhaps surprisingly given the difficulty of the structure-comparison problem, these groups seem to have converged on quite similar approaches with respect to both fast search algorithms and the identification of statistically significant similarities.
                Bookmark

                Author and article information

                Journal
                Nucleic Acids Res
                Nucleic Acids Res
                nar
                nar
                Nucleic Acids Research
                Oxford University Press
                0305-1048
                1362-4962
                1 July 2010
                10 May 2010
                10 May 2010
                : 38
                : Web Server issue
                : W545-W549
                Affiliations
                1Institute of Biotechnology and 2Department of Biosciences, University of Helsinki, Helsinki, Finland
                Author notes
                *To whom correspondence should be addressed. Tel: +358 9 19159115; Fax: +358 9 19159079; Email: liisa.holm@ 123456helsinki.fi
                Article
                gkq366
                10.1093/nar/gkq366
                2896194
                20457744
                29516b2e-122d-4e25-9544-ce9a01b810c0
                © The Author(s) 2010. Published by Oxford University Press.

                This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License ( http://creativecommons.org/licenses/by-nc/2.5), which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

                History
                : 31 January 2010
                : 12 April 2010
                : 24 April 2010
                Categories
                Articles

                Genetics
                Genetics

                Comments

                Comment on this article