Evidence map›Paper›PMID 18640907›Full record

ArticleInternational journal of bioinformatics research and applications2008

Computationally Optimised DNA Assembly of synthetic genes.

Liza S Z Larsen, Christopher D Wassman, G Wesley Hatfield, Richard H Lathrop

Abstract read
In one paragraph

Article in International journal of bioinformatics research and applications, 2008. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 10 papers.

0numbers the graph read from it
0cells of the map it votes in
10citing 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

10 citing papers in PubMed.

  1. Review
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Making green.Nature biotechnology · 2009
    Article
  10. 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

4 authors.

Liza S Z LarsenCODA Genomics Inc., Laguna Hills, CA 92653, USA. Larsen@cantab.net
Christopher D Wassman
G Wesley Hatfield
Richard H Lathrop

Funding

Univ.of Calif., Irvine Cancer Center Support GrantP30CA062203 · NCI · UNIVERSITY OF CALIFORNIA-IRVINE · PI Christine Hui · 1994 to 2026
$57.9M
Biomedical Informatics Training ProgramT15LM007443 · NLM · UNIVERSITY OF CALIFORNIA-IRVINE · PI BALDI, PIERRE · 2002 to 2012
$9.3M
A Functional Census of p53 Cancer and Suppressor MutantsR01CA112560 · NCI · UNIVERSITY OF CALIFORNIA-IRVINE · PI KAISER, PETER, LATHROP, RICHARD H · 2005 to 2013
$3.2M
Global Regulatory Networks in Escherichia ColiR01GM068903 · NIGMS · UNIVERSITY OF CALIFORNIA-IRVINE · PI HATFIELD, G. WESLEY · 2003 to 2006
$1.3M
NCI NIH HHS P30 CA062203NCI NIH HHS R01 CA112560NIGMS NIH HHS GM68903NIGMS NIH HHS R01 GM068903NLM NIH HHS NIH T15 LM-07443NLM NIH HHS T15 LM007443
6 · The paper itself

Abstract

Gene synthesis is hampered by two obstacles: improper assembly of oligonucleotides; oligonucleotide defects incurred during chemical synthesis. To overcome the first problem, we describe the employment of a Computationally Optimised DNA Assembly (CODA) algorithm that uses the degeneracy of the genetic code to design overlapping oligonucleotides with thermodynamic properties for self-assembly into a single, linear, DNA product. To address the second problem, we describe a hierarchical assembly strategy that reduces the incorporation of defective oligonucleotides into full-length gene constructs. The CODA algorithm and these biological methods enable fast, simple and reliable assemblies of sequence-correct full-length genes.

Indexed as

AlgorithmsModels, ChemicalModels, GeneticBase SequenceComputer SimulationDNAGenes, SyntheticGenetic EngineeringMolecular Sequence DataSequence Analysis, DNADNA

Identifiers

PMID18640907
PMCPMC2668710

What OpenQuestion holds

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