Difference between revisions of "BIN-FUNC-Domain annotation"
m |
m |
||
(2 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
− | <div id=" | + | <div id="ABC"> |
− | + | <div style="padding:5px; border:1px solid #000000; background-color:#b3dbce; font-size:300%; font-weight:400; color: #000000; width:100%;"> | |
Domain Annotation | Domain Annotation | ||
− | + | <div style="padding:5px; margin-top:20px; margin-bottom:10px; background-color:#b3dbce; font-size:30%; font-weight:200; color: #000000; "> | |
− | + | (Domain discovery by multiple sequence alignment; HMMER algorithm; Domain databases: Pfam, SMART, CDART; Annotation of sequences) | |
− | + | </div> | |
− | |||
− | |||
− | |||
− | Domain discovery by multiple sequence alignment; HMMER algorithm; Domain databases: Pfam, SMART, CDART; Annotation of sequences | ||
</div> | </div> | ||
− | {{ | + | {{Smallvspace}} |
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | < | + | <div style="padding:5px; border:1px solid #000000; background-color:#b3dbce33; font-size:85%;"> |
− | <div | + | <div style="font-size:118%;"> |
− | + | <b>Abstract:</b><br /> | |
<section begin=abstract /> | <section begin=abstract /> | ||
− | |||
This unit introduces the observation that evolution composes higher-order functions from domains that are folding units, functional units, and units of inheritance. It then covers some of the databases and services that support discovery and analysis of domains, and guides through an exercise in domain annotation. | This unit introduces the observation that evolution composes higher-order functions from domains that are folding units, functional units, and units of inheritance. It then covers some of the databases and services that support discovery and analysis of domains, and guides through an exercise in domain annotation. | ||
<section end=abstract /> | <section end=abstract /> | ||
− | + | </div> | |
− | + | <!-- ============================ --> | |
− | + | <hr> | |
− | + | <table> | |
− | == | + | <tr> |
− | === | + | <td style="padding:10px;"> |
− | < | + | <b>Objectives:</b><br /> |
− | < | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | < | ||
This unit will ... | This unit will ... | ||
* ... introduce the concept of domains in proteins and discuss the use of domains inn sequence analysis; | * ... introduce the concept of domains in proteins and discuss the use of domains inn sequence analysis; | ||
* ... demonstrate key databases and services that are available for domain analysis on the Web; | * ... demonstrate key databases and services that are available for domain analysis on the Web; | ||
* ... go through an exercise in domain annotation using R. | * ... go through an exercise in domain annotation using R. | ||
− | + | </td> | |
− | + | <td style="padding:10px;"> | |
− | + | <b>Outcomes:</b><br /> | |
− | |||
− | |||
− | < | ||
After working through this unit you ... | After working through this unit you ... | ||
* ... are familar with key databases and services for domain annotation; | * ... are familar with key databases and services for domain annotation; | ||
* ... can store domain annotations as features in your protein database; | * ... can store domain annotations as features in your protein database; | ||
* ... are able to use R's plot function for the production of generic data driven graphics. | * ... are able to use R's plot function for the production of generic data driven graphics. | ||
+ | </td> | ||
+ | </tr> | ||
+ | </table> | ||
+ | <!-- ============================ --> | ||
+ | <hr> | ||
+ | <b>Deliverables:</b><br /> | ||
+ | <section begin=deliverables /> | ||
+ | <li><b>Time management</b>: Before you begin, estimate how long it will take you to complete this unit. Then, record in your course journal: the number of hours you estimated, the number of hours you worked on the unit, and the amount of time that passed between start and completion of this unit.</li> | ||
+ | <li><b>Journal</b>: Document your progress in your [[FND-Journal|Course Journal]]. Some tasks may ask you to include specific items in your journal. Don't overlook these.</li> | ||
+ | <li><b>Insights</b>: If you find something particularly noteworthy about this unit, make a note in your [[ABC-Insights|'''insights!''' page]].</li> | ||
+ | <section end=deliverables /> | ||
+ | <!-- ============================ --> | ||
+ | <hr> | ||
+ | <section begin=prerequisites /> | ||
+ | <b>Prerequisites:</b><br /> | ||
+ | This unit builds on material covered in the following prerequisite units:<br /> | ||
+ | *[[RPR-Scripting_data_downloads|RPR-Scripting_data_downloads (Scripting Data Downloads)]] | ||
+ | *[[FND-Homology|FND-Homology (Concepts and Consequences of Homology)]] | ||
+ | <section end=prerequisites /> | ||
+ | <!-- ============================ --> | ||
+ | </div> | ||
+ | |||
+ | {{Smallvspace}} | ||
− | |||
− | + | {{Smallvspace}} | |
− | + | ||
− | + | ||
− | + | __TOC__ | |
− | |||
− | |||
− | |||
− | |||
{{Vspace}} | {{Vspace}} | ||
− | </ | + | === Evaluation === |
− | <div | + | <b>Evaluation: NA</b><br /> |
+ | <div style="margin-left: 2rem;">This unit is not evaluated for course marks.</div> | ||
== Contents == | == Contents == | ||
− | |||
Line 103: | Line 93: | ||
* Navigate to [http://pfam.xfam.org/ the '''Pfam database''']. | * Navigate to [http://pfam.xfam.org/ the '''Pfam database''']. | ||
* Search for your Mbp1 protein by entering the ID into the search field and clicking '''Go'''. | * Search for your Mbp1 protein by entering the ID into the search field and clicking '''Go'''. | ||
− | * Study the annotations. Download the annotations | + | * Study the annotations. Download the annotations as a JSON file and name it <tt>Mbp1MYSPE_Pfam.JSON</tt>. |
* Are all expected domains present? (APSES or KilA-N domain, disordered segments, Ankyrin domains, coiled coil, more ?) | * Are all expected domains present? (APSES or KilA-N domain, disordered segments, Ankyrin domains, coiled coil, more ?) | ||
* "disorder", "low complexity", and "coiled coil" annotations are not based on alignments, but on sequence analysis algorithms. Visit [https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3965110/#__sec11title '''Finn et al. (2014)'''] and read how these regions are defined<ref>"Disorder" comes from [http://iupred.enzim.hu/ '''IUPred predictions'''], "low complexity regions" are predicted by [http://mendel.imp.ac.at/METHODS/seg.server.html '''SEG'''], and "coiled coils" are predicted according to a scale developed by Rob Russell and Rune Linding; their coils server appears defunct but a similar algorithm (due to A. Lupas) is hosted [https://embnet.vital-it.ch/software/COILS_form.html '''at SIB'''].</ref>. | * "disorder", "low complexity", and "coiled coil" annotations are not based on alignments, but on sequence analysis algorithms. Visit [https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3965110/#__sec11title '''Finn et al. (2014)'''] and read how these regions are defined<ref>"Disorder" comes from [http://iupred.enzim.hu/ '''IUPred predictions'''], "low complexity regions" are predicted by [http://mendel.imp.ac.at/METHODS/seg.server.html '''SEG'''], and "coiled coils" are predicted according to a scale developed by Rob Russell and Rune Linding; their coils server appears defunct but a similar algorithm (due to A. Lupas) is hosted [https://embnet.vital-it.ch/software/COILS_form.html '''at SIB'''].</ref>. | ||
− | * Study the family annotations for: | + | |
− | **[http:// | + | * Study the (well curated!) family annotations for: |
− | **[http:// | + | **[http://pfam.xfam.org/family/PF04383 '''the KilA-N domain'''] |
− | + | **[http://pfam.xfam.org/family/PF00023 '''the Ankyrin repeat domain(s)'''] | |
+ | |||
}} | }} | ||
Line 134: | Line 125: | ||
Study the results. | Study the results. | ||
− | + | * Study the family annotations for: | |
− | * Study the | + | **[http://smart.embl-heidelberg.de/smart/do_annotation.pl?DOMAIN=KilA-N '''the KilA-N domain'''] |
− | **[http:// | + | **[http://smart.embl-heidelberg.de/smart/do_annotation.pl?DOMAIN=ANK '''the Ankyrin repeat domain(s)'''] |
− | **[http:// | + | * Note that neither the domain definitions on the sequence nor the descriptions are identical to Pfam. |
Line 209: | Line 200: | ||
{{Vspace}} | {{Vspace}} | ||
− | |||
− | |||
− | |||
− | |||
== Further reading, links and resources == | == Further reading, links and resources == | ||
− | {{#pmid: | + | {{#pmid: 30357350}}<!-- NAR: Pfam 2019 --> |
{{#pmid: 29040681}}<!-- NAR: SMART 2017 --> | {{#pmid: 29040681}}<!-- NAR: SMART 2017 --> | ||
{{#pmid: 12368255}}<!-- CDART 2002 --> | {{#pmid: 12368255}}<!-- CDART 2002 --> | ||
+ | {{#pmid: 31851420}}<!-- CDD 2020 --> | ||
<!-- <div class="reference-box">[http://www.ncbi.nlm.nih.gov]</div> --> | <!-- <div class="reference-box">[http://www.ncbi.nlm.nih.gov]</div> --> | ||
− | |||
− | |||
− | |||
− | |||
== Notes == | == Notes == | ||
− | |||
− | |||
<references /> | <references /> | ||
{{Vspace}} | {{Vspace}} | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
<div class="about"> | <div class="about"> | ||
Line 282: | Line 224: | ||
:2017-08-05 | :2017-08-05 | ||
<b>Modified:</b><br /> | <b>Modified:</b><br /> | ||
− | : | + | :2020-09-24 |
<b>Version:</b><br /> | <b>Version:</b><br /> | ||
− | :1. | + | :1.1 |
<b>Version history:</b><br /> | <b>Version history:</b><br /> | ||
+ | *1.1 2020 Updates, fixed Pfam/SMART annotation mix-up | ||
*1.0 Live version | *1.0 Live version | ||
*0.1 First stub, import of 2016 material | *0.1 First stub, import of 2016 material | ||
</div> | </div> | ||
− | |||
− | |||
{{CC-BY}} | {{CC-BY}} | ||
+ | [[Category:ABC-units]] | ||
+ | {{UNIT}} | ||
+ | {{LIVE}} | ||
</div> | </div> | ||
<!-- [END] --> | <!-- [END] --> |
Latest revision as of 05:34, 25 September 2020
Domain Annotation
(Domain discovery by multiple sequence alignment; HMMER algorithm; Domain databases: Pfam, SMART, CDART; Annotation of sequences)
Abstract:
This unit introduces the observation that evolution composes higher-order functions from domains that are folding units, functional units, and units of inheritance. It then covers some of the databases and services that support discovery and analysis of domains, and guides through an exercise in domain annotation.
Objectives:
|
Outcomes:
|
Deliverables:
Prerequisites:
This unit builds on material covered in the following prerequisite units:
Contents
Evaluation
Evaluation: NA
Contents
Task:
- Read the introductory notes on how domain annotations support the annotation of gene function.
Pfam
The Pfam protein domain family database is a large, curated collection of domain definitions and doamin annotations. Domains are discovered from multiple sequecne alignments, and represented as Hidden Markov Models (a probabilistic technique that can define a probability that a given sequence is part of a family the model was trained on).
Task:
- Retrieve the MYSPE UniProt ID from your Journal, or by issuing the following R commands:
pName <- sprintf("MBP1_%s", biCode(MYSPE))
sel <- which(myDB$protein$name == pName)
myDB$protein$UniProtID[sel]
- Navigate to the Pfam database.
- Search for your Mbp1 protein by entering the ID into the search field and clicking Go.
- Study the annotations. Download the annotations as a JSON file and name it Mbp1MYSPE_Pfam.JSON.
- Are all expected domains present? (APSES or KilA-N domain, disordered segments, Ankyrin domains, coiled coil, more ?)
- "disorder", "low complexity", and "coiled coil" annotations are not based on alignments, but on sequence analysis algorithms. Visit Finn et al. (2014) and read how these regions are defined[1].
- Study the (well curated!) family annotations for:
SMART domain annotation
The SMART database at the EMBL in Heidelberg integrates a number of feature detection tools including Pfam domain annotation and its own, HMM based SMART domain database. You can search by sequence, or by accession number and retrieve domain annotations and more.
SMART search
Task:
- Access the SMART database at http://smart.embl-heidelberg.de/
- Click the link to access SMART in the normal mode.
- Paste the MYSPE Mbp1 UniProtID into the Sequence ID or ACC field.
- Check all the boxes for:
- outlier homologues (also including homologues in the PDB structure database)
- PFAM domains (domains defined by sequence similarity in the PFAM database)
- signal peptides (using the Gunnar von Heijne's SignalP 4.0 server at the Technical University in Lyngby, Denmark)
- internal repeats (using the programs ariadne and prospero at the Wellcome Trust Centre for Human Genetics at Oxford University, England)
- Click on Sequence SMART to run the search and annotation. (In case you get an error like: "Sorry, your entry seems to have no SMART domain ...", try again with the actual sequence instead of the accession number.)
Study the results.
- Study the family annotations for:
- Note that neither the domain definitions on the sequence nor the descriptions are identical to Pfam.
- Note down the following information so you can enter the annotation in the protein database for MYSPE:
- From the section on "Confidently predicted domains ..."
- The start and end coordinates of the KilA-N domain (...according to SMART, not Pfam, in case the two differ).
- All start and end coordinates of low complexity segments
- All start and end coordinates of ANK (Ankyrin) domains
- Start and end coordinates of coiled coil domain(s) I expect only one.
- Start and end coordinates of AT hook domain(s) I expect some but not all not all Mbp1 orthologues have one.
- From the section on "Features NOT shown ..."
- All start and end coordinates of low complexity segments for which the Reason is "overlap".
- Any start and end coordinates of overlapping coiled coil segments.
- I expect all other annotations - besides the overlapping KilA-N domain defined by Pfam - to arise from the succession of ankyrin domains that the proteins have, both Pfam_ANK.. domains, as well as internal repeats, OR to be excluded because they did not exceed the significance threshold. However, if there are other features I have not mentioned here, please let me know.
- From the section on "Outlier homologues ..."
- Start and end coordinates of a PDB:1SW6|B annotation (if you have one): this is a region of sequence similarity to a protein for which the 3D structural coordinate are known.
- Of course there should also be annotations to the structure of 1BM8 / 1MB1 and/or 1L3G - all of which are structures of the Mbp1 APSES domain that we have already annotated as an"APSES fold" feature previously. And there will be BLAST annotations to Ankyrin domains. We will not annotate these separately either.
- From the section on "Confidently predicted domains ..."
- Follow the links to the database entries for the information so you know what these domains and features are.
Next we'll enter the features into our database, so we can compare them with the annotations that I have prepared from SMART annotations of Mbp1 orthologues from the ten reference fungi.
Visual comparison of domain annotations in R
The versatile plotting functions of R allow us to compare domain annotations. The distribution of segments that are annotated as "low-complexity, presumably disordered, is particularly interesting: these are functional features that are often not alignable since there is no selective pressure on sequence similarity but they may have arisen from convergent evolution or diverged while maintaining average composition, not specific sequence. Sequence alignment is after all based on amino acid pair scores that have been optimized to detect amino acids that behave similarly in the same context of folded proteins.
In the following code tutorial, we create a plot similar to the CDD and SMART displays. It is based on the SMART domain annotations of the reference species in our protein database.
Task:
- Open RStudio and load the
ABC-units
R project. If you have loaded it before, choose File → Recent projects → ABC-Units. If you have not loaded it before, follow the instructions in the RPR-Introduction unit. - Choose Tools → Version Control → Pull Branches to fetch the most recent version of the project from its GitHub repository with all changes and bug fixes included.
- Type
init()
if requested. - Open the file
BIN-FUNC-Domain_annotation.R
and follow the instructions.
Note: take care that you understand all of the code in the script. Evaluation in this course is cumulative and you may be asked to explain any part of code.
After you have worked through this code, your plot should look similar to this one:
CDART
The CDART database (Conserved Domain Architecture Retrieval Tool) finds proteins that have a similar domain architecture as a query. This has the potential to find homologous and functionally related proteins that are far todissimilar to be detected with sequence similarity searches.
Task:
- Retrieve the MYSPE Refseq ID from your Journal or by issuing the following R commands:
pName <- sprintf("MBP1_%s", biCode(MYSPE))
sel <- which(myDB$protein$name == pName)
myDB$protein$RefSeqID[sel]
- Navigate to CDART.
- Paste your Mbp1 protein ID and click Submit.
- Note that the first page of the (very long!) results list shows proteisn that contain both KilA-N and Ankyrin domains. However a few other domains are found as well (Atrophin, GNVR, SMV_N), and this raises the intriguing possibility that the MBP1_MYSPE protein might contain some or all of these as well, although the sequence similarity may be to low to detect this outright.
- Study the domain annotations for
Further reading, links and resources
El-Gebali et al. (2019) The Pfam protein families database in 2019. Nucleic Acids Res 47:D427-D432. (pmid: 30357350) |
[ PubMed ] [ DOI ] The last few years have witnessed significant changes in Pfam (https://pfam.xfam.org). The number of families has grown substantially to a total of 17,929 in release 32.0. New additions have been coupled with efforts to improve existing families, including refinement of domain boundaries, their classification into Pfam clans, as well as their functional annotation. We recently began to collaborate with the RepeatsDB resource to improve the definition of tandem repeat families within Pfam. We carried out a significant comparison to the structural classification database, namely the Evolutionary Classification of Protein Domains (ECOD) that led to the creation of 825 new families based on their set of uncharacterized families (EUFs). Furthermore, we also connected Pfam entries to the Sequence Ontology (SO) through mapping of the Pfam type definitions to SO terms. Since Pfam has many community contributors, we recently enabled the linking between authorship of all Pfam entries with the corresponding authors' ORCID identifiers. This effectively permits authors to claim credit for their Pfam curation and link them to their ORCID record. |
Letunic & Bork (2018) 20 years of the SMART protein domain annotation resource. Nucleic Acids Res 46:D493-D496. (pmid: 29040681) |
[ PubMed ] [ DOI ] SMART (Simple Modular Architecture Research Tool) is a web resource (http://smart.embl.de) for the identification and annotation of protein domains and the analysis of protein domain architectures. SMART version 8 contains manually curated models for more than 1300 protein domains, with approximately 100 new models added since our last update article (1). The underlying protein databases were synchronized with UniProt (2), Ensembl (3) and STRING (4), doubling the total number of annotated domains and other protein features to more than 200 million. In its 20th year, the SMART analysis results pages have been streamlined again and its information sources have been updated. SMART's vector based display engine has been extended to all protein schematics in SMART and rewritten to use the latest web technologies. The internal full text search engine has been redesigned and updated, resulting in greatly increased search speed. |
Geer et al. (2002) CDART: protein homology by domain architecture. Genome Res 12:1619-23. (pmid: 12368255) |
[ PubMed ] [ DOI ] The Conserved Domain Architecture Retrieval Tool (CDART) performs similarity searches of the NCBI Entrez Protein Database based on domain architecture, defined as the sequential order of conserved domains in proteins. The algorithm finds protein similarities across significant evolutionary distances using sensitive protein domain profiles rather than by direct sequence similarity. Proteins similar to a query protein are grouped and scored by architecture. Relying on domain profiles allows CDART to be fast, and, because it relies on annotated functional domains, informative. Domain profiles are derived from several collections of domain definitions that include functional annotation. Searches can be further refined by taxonomy and by selecting domains of interest. CDART is available at http://www.ncbi.nlm.nih.gov/Structure/lexington/lexington.cgi. |
Yang et al. (2020) NCBI's Conserved Domain Database and Tools for Protein Domain Analysis. Curr Protoc Bioinformatics 69:e90. (pmid: 31851420) |
[ PubMed ] [ DOI ] The Conserved Domain Database (CDD) is a freely available resource for the annotation of sequences with the locations of conserved protein domain footprints, as well as functional sites and motifs inferred from these footprints. It includes protein domain and protein family models curated in house by CDD staff, as well as imported from a variety of other sources. The latest CDD release (v3.17, April 2019) contains more than 57,000 domain models, of which almost 15,000 were curated by CDD staff. The CDD curation effort increases coverage and provides finer-grained classifications of common and widely distributed protein domain families, for which a wealth of functional and structural data have become available. The CDD maintains both live search capabilities and an archive of pre-computed domain annotations for a selected subset of sequences tracked by the NCBI's Entrez protein database. These can be retrieved or computed for a single sequence using CD-Search or in bulk using Batch CD-Search, or computed via standalone RPS-BLAST plus the rpsbproc software package. The CDD can be accessed via https://www.ncbi.nlm.nih.gov/Structure/cdd/cdd.shtml. The three protocols listed here describe how to perform a CD-Search (Basic Protocol 1), a Batch CD-Search (Basic Protocol 2), and a Standalone RPS-BLAST and rpsbproc (Basic Protocol 3). © 2019 The Authors. Basic Protocol 1: CD-search Basic Protocol 2: Batch CD-search Basic Protocol 3: Standalone RPS-BLAST and rpsbproc. |
Notes
- ↑ "Disorder" comes from IUPred predictions, "low complexity regions" are predicted by SEG, and "coiled coils" are predicted according to a scale developed by Rob Russell and Rune Linding; their coils server appears defunct but a similar algorithm (due to A. Lupas) is hosted at SIB.
About ...
Author:
- Boris Steipe <boris.steipe@utoronto.ca>
Created:
- 2017-08-05
Modified:
- 2020-09-24
Version:
- 1.1
Version history:
- 1.1 2020 Updates, fixed Pfam/SMART annotation mix-up
- 1.0 Live version
- 0.1 First stub, import of 2016 material
This copyrighted material is licensed under a Creative Commons Attribution 4.0 International License. Follow the link to learn more.