Searching across hundreds of databases

Our searching services are busy right now. Your search will reload in five seconds.

X
Forgot Password

If you have forgotten your password you can enter your email here and get a temporary password sent to your email.

X
Forgot Password

If you have forgotten your password you can enter your email here and get a temporary password sent to your email.

Molecular evolution of the LNX gene family.

BMC evolutionary biology | 2011

LNX (Ligand of Numb Protein-X) proteins typically contain an amino-terminal RING domain adjacent to either two or four PDZ domains - a domain architecture that is unique to the LNX family. LNX proteins function as E3 ubiquitin ligases and their domain organisation suggests that their ubiquitin ligase activity may be targeted to specific substrates or subcellular locations by PDZ domain-mediated interactions. Indeed, numerous interaction partners for LNX proteins have been identified, but the in vivo functions of most family members remain largely unclear.

Pubmed ID: 21827680 RIS Download

Research resources used in this publication

None found

Antibodies used in this publication

None found

Associated grants

None

Publication data is provided by the National Library of Medicine ® and PubMed ®. Data is retrieved from PubMed ® on a weekly schedule. For terms and conditions see the National Library of Medicine Terms and Conditions.

This is a list of tools and resources that we have found mentioned in this publication.


InterPro (tool)

RRID:SCR_006695

Service providing functional analysis of proteins by classifying them into families and predicting domains and important sites. They combine protein signatures from a number of member databases into a single searchable resource, capitalizing on their individual strengths to produce a powerful integrated database and diagnostic tool. This integrated database of predictive protein signatures is used for the classification and automatic annotation of proteins and genomes. InterPro classifies sequences at superfamily, family and subfamily levels, predicting the occurrence of functional domains, repeats and important sites. InterPro adds in-depth annotation, including GO terms, to the protein signatures. You can access the data programmatically, via Web Services. The member databases use a number of approaches: # ProDom: provider of sequence-clusters built from UniProtKB using PSI-BLAST. # PROSITE patterns: provider of simple regular expressions. # PROSITE and HAMAP profiles: provide sequence matrices. # PRINTS provider of fingerprints, which are groups of aligned, un-weighted Position Specific Sequence Matrices (PSSMs). # PANTHER, PIRSF, Pfam, SMART, TIGRFAMs, Gene3D and SUPERFAMILY: are providers of hidden Markov models (HMMs). Your contributions are welcome. You are encouraged to use the ''''Add your annotation'''' button on InterPro entry pages to suggest updated or improved annotation for individual InterPro entries.

View all literature mentions

ADDA - Automatic Domain Decomposition Algorithm (tool)

RRID:SCR_007546

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.

View all literature mentions

SMART (tool)

RRID:SCR_005026

Software tool for identification and annotation of genetically mobile domains and analysis of domain architectures.

View all literature mentions

TBLASTN (tool)

RRID:SCR_011822

Tool to search translated nucleotide databases using a protein query.

View all literature mentions

PhyML (tool)

RRID:SCR_014629

Web phylogeny server based on the maximum-likelihood principle.

View all literature mentions