PubMed Health⌕ Search

PubMed · 16766523

Translation initiation factor eIF4G-1 binds to eIF3 through the eIF3e subunit.

Abstract

eIF3 in mammals is the largest translation initiation factor ( approximately 800 kDa) and is composed of 13 nonidentical subunits designated eIF3a-m. The role of mammalian eIF3 in assembly of the 48 S complex occurs through high affinity binding to eIF4G. Interactions of eIF4G with eIF4E, eIF4A, eIF3, poly(A)-binding protein, and Mnk1/2 have been mapped to discrete domains on eIF4G, and conversely, the eIF4G-binding sites on all but one of these ligands have been determined. The only eIF4G ligand for which this has not been determined is eIF3. In this study, we have sought to identify the mammalian eIF3 subunit(s) that directly interact(s) with eIF4G. Established procedures for detecting protein-protein interactions gave ambiguous results. However, binding of partially proteolyzed HeLa eIF3 to the eIF3-binding domain of human eIF4G-1, followed by high throughput analysis of mass spectrometric data with a novel peptide matching algorithm, identified a single subunit, eIF3e (p48/Int-6). In addition, recombinant FLAG-eIF3e specifically competed with HeLa eIF3 for binding to eIF4G in vitro. Adding FLAG-eIF3e to a cell-free translation system (i) inhibited protein synthesis, (ii) caused a shift of mRNA from heavy to light polysomes, (iii) inhibited cap-dependent translation more severely than translation dependent on the HCV or CSFV internal ribosome entry sites, which do not require eIF4G, and (iv) caused a dramatic loss of eIF4G and eIF2alpha from complexes sedimenting at approximately 40 S. These data suggest a specific, direct, and functional interaction of eIF3e with eIF4G during the process of cap-dependent translation initiation, although they do not rule out participation of other eIF3 subunits.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Aaron K LeFebvre, Nadejda L Korneeva, Marjan Trutschl, Urska Cvek, Roy D Duzan, Christopher A Bradley, John W B Hershey, Robert E Rhoads. 2006-06-09. Translation initiation factor eIF4G-1 binds to eIF3 through the eIF3e subunit.. https://doi.org/10.1074/jbc.m605418200

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

A note on a generalized single step theory for any number of hierarchical genomic matrices.

BACKGROUND: The Single Step algorithm allows combining information from genotyped and un-genotyped individuals, provided they are connected by a pedigree. However, current single step theory is limited to a single list of markers. RESULTS: We present a generalized single step (GSS) method that can accommodate any number of hierarchical molecular datasets (e.g. sequence, high and low density arrays) and pedigree, avoiding imputation. We prove that a similar efficient inversion algorithm exists. The method is recursive, starting with the highest marker density scenario. We illustrate the method with simulation and show that GSS can increase predictive accuracy compared to standard single step. R code is provided so that custom scenarios can be easily compared, either with simulated or real data. CONCLUSION: The method developed generalizes extant single step theory to any number of hierarchical molecular relationship matrices, broadening the scenarios where single step can be applied. A topic of particular interest can be ecology field data or human populations where pedigree is not available, but where samples sequenced and genotyped at different densities can exist. GSS can also be a useful tool to optimize allocation of genotyping and / or sequencing resources.

Algorithms↗

cgDist: Nucleotide-level distance calculation from cgMLST allelic profiles.

Bacterial genomic surveillance requires balancing computational efficiency with genetic resolution for effective cluster investigation. cgMLST distance calculations treat all allelic differences as equivalent units, obscuring nucleotide-level variation. Furthermore, single nucleotide polymorphism-based pipelines provide finer resolution at substantially higher computational cost, which limits their routine deployment in surveillance laboratories. We present cgDist, an algorithm that calculates nucleotide-level distances directly from cgMLST allelic profiles, providing finer resolution than allele-count distances by leveraging within-allele nucleotide variation. The cache architecture stores alignment statistics, enabling distance calculation modes without computation and supporting both dataset-specific and schema-complete cache generation. This design enables incremental surveillance analysis, with performance benefits as laboratories accumulate alignment data. cgDist functions as a precision 'zoom lens' for the investigation of clusters identified through initial cgMLST screening. Rather than restructuring population relationships, this targeted approach concentrates enhanced resolution where it is most informative. The algorithm ensures that cgDist distances are greater than or equal to corresponding cgMLST distances, preserving epidemiological interpretability while adding genetic discrimination. By increasing resolution within identified clusters, cgDist may also support outbreak investigation, a potential application that remains to be evaluated on outbreak-derived data.

Algorithms↗

Theseus: fast and optimal affine-gap sequence-to-graph alignment.

MOTIVATION: Sequence-to-graph alignment is a central problem in bioinformatics, with applications in multiple sequence alignment (MSA) and pangenome analysis, among others. However, current algorithms for optimal affine-gap alignment impose high memory and computational requirements, limiting their scalability to aligning long sequences to complex graphs. Practical solutions partially address this problem using heuristic strategies that ultimately trade off optimality for speed. RESULTS: This work presents Theseus, a novel, fast, and optimal affine-gap sequence-to-graph alignment algorithm. Theseus leverages similarities between genomic sequences to accelerate the alignment computation and reduces the overall memory requirements without compromising optimality. To that end, Theseus processes only a subset of the dynamic programming cells, using a sparse-data strategy that enables efficient sequence-to-graph alignment. Moreover, our algorithm supports optimal affine-gap alignment on arbitrary directed graphs, including those with cycles. We evaluate Theseus on two key problems: MSA and pangenome read mapping. For MSA, we compare it against SPOA, abPOA, and POASTA. Theseus is 1.6× to 17.6× faster than POASTA, and 7.3× faster, on average, than SPOA, both optimal aligners. Compared with abPOA, Theseus ensures optimality and scales to the largest problems. For pangenome read mapping, we benchmark Theseus against the alignment stage of the mapping tool vg map, along with the alignment kernels of SPOA, abPOA, and POASTA. Theseus outperforms the other methods, showing a 1.9× to 16.9× speedup on short reads. Moreover, Theseus is 1.5× to 36.3× faster than vg when aligning against synthetic cyclic graphs. AVAILABILITY AND IMPLEMENTATION: Theseus code and documentation are publicly available at https://github.com/albertjimenezbl/theseus-lib.

Algorithms↗