Evidence map›Paper›PMID 22536901›Full record

ArticleBMC bioinformatics2012

Algorithms for optimizing cross-overs in DNA shuffling.

Lu He, Alan M Friedman, Chris Bailey-Kellogg

Open access · goldAbstract read
In one paragraph

Article in BMC bioinformatics, 2012. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 5 papers.

0numbers the graph read from it
0cells of the map it votes in
5citing papers in PubMed
0.3field-weighted citation impact, top 41% of its field
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

5 citing papers in PubMed, 18 citations in OpenAlex.

  1. Genetic Modification Approaches for ParasporinsMolecules (Basel, Switzerland) · 2021
    Review
  2. Generation of Cry11 Variants ofEvolutionary bioinformatics online · 2020
    Article
  3. Article
  4. Review
  5. Article
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

3 authors at 2 institutions in 1 country.

Lu HeDept of Computer Science, Dartmouth College, 6211 Sudikoff Laboratory, Hanover, NH 03755, USA.
Alan M Friedman
Chris Bailey-Kellogg
Dartmouth College · USPurdue University West Lafayette · US

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundDNA shuffling generates combinatorial libraries of chimeric genes by stochastically recombining parent genes. The resulting libraries are subjected to large-scale genetic selection or screening to identify those chimeras with favorable properties (e.g., enhanced stability or enzymatic activity). While DNA shuffling has been applied quite successfully, it is limited by its homology-dependent, stochastic nature. Consequently, it is used only with parents of sufficient overall sequence identity, and provides no control over the resulting chimeric library.

resultsThis paper presents efficient methods to extend the scope of DNA shuffling to handle significantly more diverse parents and to generate more predictable, optimized libraries. Our CODNS (cross-over optimization for DNA shuffling) approach employs polynomial-time dynamic programming algorithms to select codons for the parental amino acids, allowing for zero or a fixed number of conservative substitutions. We first present efficient algorithms to optimize the local sequence identity or the nearest-neighbor approximation of the change in free energy upon annealing, objectives that were previously optimized by computationally-expensive integer programming methods. We then present efficient algorithms for more powerful objectives that seek to localize and enhance the frequency of recombination by producing "runs" of common nucleotides either overall or according to the sequence diversity of the resulting chimeras. We demonstrate the effectiveness of CODNS in choosing codons and allocating substitutions to promote recombination between parents targeted in earlier studies: two GAR transformylases (41% amino acid sequence identity), two very distantly related DNA polymerases, Pol X and β (15%), and beta-lactamases of varying identity (26-47%).

conclusionsOur methods provide the protein engineer with a new approach to DNA shuffling that supports substantially more diverse parents, is more deterministic, and generates more predictable and more diverse chimeric libraries.

Indexed as

AlgorithmsDNA ShufflingAfrican Swine Fever VirusAmino Acid SequenceAnimalsBacteriabeta-LactamasesCodonEscherichia coliGene LibraryHumansPhosphoribosylglycinamide FormyltransferaseProtein EngineeringRatsSequence AlignmentSoftwarebeta-LactamasesCodonPhosphoribosylglycinamide Formyltransferase

Identifiers

PMID22536901
PMCPMC3333841
OpenAlexW2108703244

What OpenQuestion holds

Textmetadata
LicenceCC BY
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.