ADDA - Automatic Domain Decomposition Algorithm

Biocenter SymbolBiocenter - Viikki
Home     Sequence     Family     Browse     Genomes     Statistics     Download     Help

ADDA - Automatic decomposition of domain families

Summary

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 used to build PFAM-B families - the PFAM server is now the best location for browsing latest domain definitions. The latest ADDA domain definitions can be downloaded from here. This server is not being updated and is preserved for historical purposes.

Choose:

Search for a protein by identifier, accession number or by its sequence,
Search for a domain family,
Browse the domain families,
Go to quality control and statistics,
Go to the download area (academic licence).

Reference

Heger A, Holm LU (2003) Exhaustive enumeration of protein domain families.
J Mol Biol 328(3):749-67.


Quick Sequence Search:  

Help & Other Resources

 
 




 
 

The Holm Group
Services & Tools

ADDA FAQs

A collection of Frequently Asked Questions about ADDA

   
 

Selected Links

 

 

ADDA Support Team
Andreas Heger
Liisa Holm
Chris Wilton
 
 
Powered by Zope