Searching the RRID Resource Information Network
Are you sure you want to leave this community? Leaving the community will revoke any permissions you have been granted in this community.
URL: http://ekhidna.biocenter.helsinki.fi/sqgraph/pairsdb
Proper Citation: ADDA - Automatic Domain Decomposition Algorithm (RRID:SCR_007546)
Description: This is a web interface for ADDA, an automatic algorithm for domain decomposition and clustering of all protein domain families. We use alignments derived from an all-on-all sequence comparison to define domains within protein sequences based on a global maximum likelihood model. ADDA is downloadable. There are three ways in which you can retrieve a protein sequence and its domains from ADDA. Sequences can be located using sequence identifiers and/or accession numbers, using a identical fragment lookup, or by running BLAST against all sequences in ADDA. ADDA is a protein sequence clustering algorithm. It takes a set of sequences and returns domain families. ADDA has two steps corresponding to the two aspects of the protein sequence clustering domain. First, ADDA splits protein sequences into domains. The idea behind ADDA is in principle the application of Occam''s razor; the goal is to describe the diversity of protein sequences with a minimal set of protein domains. The algorithm behind ADDA approximates this minimal set. In practice ADDA works by looking at where BLAST alignments are located on the sequence and splits the sequences, so that as few as possible alignments are cut by domain boundaries and that as many alignments as possible stretch over complete domains. Secondly, ADDA takes all the domains and then arranges them in a minimum spanning tree, where the similarity between two domains is determined by their relative overlap given a BLAST alignment. Each link in the tree is then checked by a pairwise profile-profile comparison and links below a threshold are removed. The remaining connected components are then taken to represent protein domain families.
Abbreviations: ADDA
Synonyms: Automatic Domain Decomposition Algorithm
Resource Type: analysis service resource, service resource, production service resource, database, data analysis service, data or information resource
Defining Citation: PMID:12706730
Expand Allhas parent organization |
We found {{ ctrl2.mentions.all_count }} mentions in open access literature.
We have not found any literature mentions for this resource.
We are searching literature mentions for this resource.
Most recent articles:
{{ mention._source.dc.creators[0].familyName }} {{ mention._source.dc.creators[0].initials }}, et al. ({{ mention._source.dc.publicationYear }}) {{ mention._source.dc.title }} {{ mention._source.dc.publishers[0].name }}, {{ mention._source.dc.publishers[0].volume }}({{ mention._source.dc.publishers[0].issue }}), {{ mention._source.dc.publishers[0].pagination }}. (PMID:{{ mention._id.replace('PMID:', '') }})
Check
for all resource mentions.
A list of researchers who have used the resource and an author search tool
A list of researchers who have used the resource and an author search tool. This is available for resources that have literature mentions.
No rating or validation information has been found for ADDA - Automatic Domain Decomposition Algorithm.
No alerts have been found for ADDA - Automatic Domain Decomposition Algorithm.
Source: SciCrunch Registry
