Proteins · Database
Pfam
A database of protein families, domains and functional annotations built using profile hidden Markov models.
What Pfam is
Pfam is a biological database that classifies proteins into families and domains, providing functional annotations and multiple sequence alignments. Established in 1995 by Erik Sonnhammer, Sean Eddy and Richard Durbin, it was designed to improve the speed and accuracy of semi-automated genome annotation, initially supporting work on the Caenorhabditis elegans genome. It is maintained by an international consortium and delivered through the InterPro platform at EMBL-EBI.
The resource classifies protein sequences into distinct entry types: families, domains, repeats and motifs. A domain acts as an autonomous structural or reusable sequence unit across different contexts, while repeats typically combine in tandem to form stable structures, and motifs present shorter sequence signals outside globular domains. Families sharing a common evolutionary origin, as supported by structural and sequence evidence, are further organised into broader groupings termed clans.
Pfam supports a broad spectrum of research across molecular biology. Experimental and computational biologists consult it to characterise unstudied proteins, structural biologists use it to identify targets for structure determination, and evolutionary biologists trace protein origins. It also catalogs domains of unknown function (DUFs), which represent conserved sequences across species whose biological roles remain to be determined.
How it is organised
Pfam entries are built using a two-tier alignment strategy. For each family, representative sequences drawn primarily from pfamseq (a non-redundant database of reference proteomes) and UniProtKB are aligned into a curated seed alignment. The HMMER software package converts this seed alignment into a profile hidden Markov model (profile HMM), capturing position-specific conservation across the family. This model is then searched against sequence databases, and matching sequences that exceed a manually defined gathering threshold are compiled into a full alignment.
Gathering thresholds are individually calibrated to maximise true positive detections while excluding false positives, which are monitored by checking overlaps against families that do not share a clan. Relationships between families within clans are guided by comparisons using tools such as SCOOP and structural information from the ECOD database. For searching queries, the InterPro web interface allows researchers to submit protein or nucleotide sequences, with DNA translated across all six reading frames prior to HMM matching.
Key facts
- Current release
- 37.0 (June 2024)
- Total families
- 21,979
- Annotation records
- 128 million
- Underlying software
- HMMER
- Founding year
- 1995
- Founders
- Erik Sonnhammer, Sean Eddy, and Richard Durbin
- Entry types
- Family, domain, repeat, motif
- Host platform
- InterPro at EMBL-EBI
What you can use it for
- Genome annotation
- Annotate newly sequenced genomes by matching predicted protein or six-frame translated DNA sequences against profile HMMs to assign functional domains.
- Remote homology detection
- Detect distant evolutionary relationships in divergent sequences by weighting conserved positions through profile HMM searches rather than standard pairwise BLAST.
- Structural biology target selection
- Identify uncharacterised protein domains or boundaries to select suitable candidate targets for experimental structure determination.
- Domain architecture analysis
- Examine the arrangement, co-occurrence, and species distribution of functional domains, motifs, and repeats across protein sequences.
Strengths and limits
Good at
- Profile hidden Markov models allow sensitive detection of remote homologies compared to standard BLAST searches.
- Manual curation of seed alignments and gathering thresholds minimises false-positive domain assignments.
- Grouping related families into clans provides clear hierarchical organisation based on common evolutionary ancestry.
Watch out for
- A growing proportion of entries consist of domains of unknown function (DUFs) that lack characterised biological roles.
- Proteins lacking similarity to known seed alignments or existing Pfam-A models cannot be annotated without automated supplements like Pfam-B.
Questions
Can I search Pfam without writing code?
Pfam is catalogued here but not yet queried live, so the agent can point you to it but cannot search it for you yet.
Can I reuse data from Pfam?
Pfam publishes its own terms of use; read them on https://www.ebi.ac.uk/interpro before reusing its records.
What is the difference between a Pfam seed alignment and a full alignment?
A seed alignment is a curated set of representative sequence members used to build the family's profile hidden Markov model. The full alignment comprises all sequences in the underlying sequence database that score above the curated gathering threshold when searched against that model.
Can I search DNA sequences against Pfam?
Yes. When DNA sequences are submitted to the search tool via InterPro, the sequence is automatically translated across all six reading frames and each frame is searched against the profile HMMs.
What is a Pfam clan?
A clan is a collection of two or more Pfam families that share a single evolutionary origin, verified by similarities in structure, function, sequence alignments, and hidden Markov models.
What are domains of unknown function (DUFs)?
DUFs are conserved protein domains identified across multiple species for which no specific biological function has yet been experimentally determined. They are sequentially named and updated when the function of a representative member is discovered.
Written from Pfam's own website and reference material. Statements citing a figure that does not appear there are removed before publication. Licence and running details come from our registry.