Evidence map›Paper›PMID 39990946›Full record

ArticleACS bio & med chem Au2025

Terminator: A Software Package for Fast and Local Optimization of His-Tag Placement for Protein Affinity Purification.

Rokas Gerulskis, Shelley D Minteer

Abstract read
In one paragraph

Article in ACS bio & med chem Au, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

Rokas GerulskisDepartment of Chemistry, University of Utah, Salt Lake City, Utah 84112, United States.
Shelley D MinteerDepartment of Chemistry, University of Utah, Salt Lake City, Utah 84112, United States.ORCID https://orcid.org/0000-0002-5788-2249

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Although the use of affinity tags can greatly improve purification of expressed enzymes, the placement of affinity tags can significantly impact the expression, solubility, and function of recombinant proteins. To facilitate the optimal design of 6xHis-tagged constructs for protein purification, we developed Terminator, a Python-based software package, which takes a UniProt ID or existing protein sequence as input, identifies related sequences, maps sequence conservation retrieved from ConSurf onto protein 3D structures retrieved from the PDB and SWISS-MODEL, and analyzes proximity to cavities and functional sites to recommend the N- or C-terminus for placement of 6xHis fusion tags <15 residues in length. The package also outputs a document with available purification and activity literature for the target and closely related proteins organized by year. Comparative analysis of Terminator predictions against published experimental tag behavior for 6xHis fusion tags <15 residues in length demonstrates an 86-100% accuracy in predicting the relative risk of ill effects between termini and a 92-93% accuracy in predicting the absolute risk of modifying individual termini. This reliability of Terminator's analysis suggests that proximity to surface cavities, not burial of wild-type termini, is the most reliable predictor of ill effects arising from short 6xHis fusion tags. This tool aims to expedite construct design and enhance the successful production of well-behaved proteins for studies in enzymology and biocatalysis with minimal need for computational resources, programming knowledge, or familiarity with protein-tag interference mechanisms.

Identifiers

PMID39990946
PMCPMC11843336

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.