Computational gene

Computational gene
Figure 1: Design of a computational gene

A computational gene [1][2][3] is a molecular automaton consisting of a structural part and a functional part; and its design is such that it might work in a cellular environment. The structural part is a naturally occurring gene, which is used as a skeleton to encode the input and the transitions of the automaton (Fig. 1A). The conserved features of a structural gene (e.g., DNA polymerase binding site, start and stop codons, and splicing sites) serve as constants of the computational gene, while the coding regions, the number of exons and introns, the position of start and stop codon, and the automata theoretical variables (symbols, states, and transitions) are the design parameters of the computational gene. The constants and the design parameters are linked by several logical and biochemical constraints (e.g., encoded automata theoretic variables must not be recognized as splicing junctions). The input of the automaton are molecular markers given by single stranded DNA (ssDNA) molecules. These markers are signalling aberrant (e.g., carcinogenic) molecular phenotype and turn on the self-assembly of the functional gene. If the input is accepted, the output encodes a double stranded DNA (dsDNA) molecule, a functional gene which should be successfully integrated into the cellular transcription and translation machinery producing a wild type protein or an anti-drug (Fig. 1B). Otherwise, a rejected input will assemble into a partially dsDNA molecule which cannot be translated.

Contents

A Potential Application: In Situ Diagnostics and Therapy of Cancer

Computational genes might be used in future to correct aberrant mutations in a gene or group of genes that can trigger disease phenotypes[4]. One of the most prominent examples is the tumor suppressor p53 gene, which is present in every cell, and acts as a guard to control the growth. Mutations in this gene can abolish its function, allowing uncontrolled growth that can lead to cancer [5]. For instance, a mutation at codon 249 in the p53 protein is characteristic for hepatocellular cancer [6]. This disease could be treated by the CDB3 peptide which binds to the p53 core domain and stabilises its fold [7].

A single disease-related mutation can be then diagnosed and treated by the following diagnostic rule,

 if protein X_mutated_at_codon_Y then produce_drug fi  (1)
Figure 2: Diagnostics of pathogenic mutations
Figure 3: Therapy of pathogenic mutations

Such a rule might be implemented by a molecular automaton consisting of two partially dsDNA molecules and one ssDNA molecule, which corresponds to the disease-related mutation and provides a molecular switch for the linear self-assembly of the functional gene (Fig. 2). The gene structure is completed by a cellular ligase present in both eukaryotic and prokaryotic cells. The transcription and translation machinery of the cell is then in charge of therapy and administers either a wild-type protein or an anti-drug (Fig. 3). The rule (1) may even be generalised to involve mutations from different proteins allowing a combined diagnosis and therapy.

In this way, computational genes might allow implementation in situ of a therapy as soon as the cell starts developing defective material. Computational genes combine the techniques of gene therapy which allows to replace in the genome an aberrant gene by its healthy counterpart, as well as to silence the gene expression (similar to antisense technology).

Challenges

Although mechanistically simple and quite robust on molecular level, several issues need to be addressed before an in vivo implementation of computational genes can be considered. First, the DNA material must be internalised into the cell, specifically into the nucleus. In fact, the transfer of DNA or RNA through biological membranes is a key step in the drug delivery [8]. Some results show that nuclear localisation signals can be irreversibly linked to one end of the oligonucleotides, forming an oligonucleotide-peptide conjugate that allows effective internalisation of DNA into the nucleus [9].

In addition, the DNA complexes should have low immunogenicity to guarantee their integrity in the cell and their resistance to cellular nucleases. Current strategies to eliminate nuclease sensitivity include modifications of the oligonucleotide backbone such as methylphosphonate [10] and phosphorothioate (S-ODN) oligodeoxynucleotides [11], but along with their increased stability, modified oligonucleotides often have altered pharmacologic properties [12].

Finally, similar to any other drug, DNA complexes could cause nonspecific and toxic side effects. In vivo applications of antisense oligonucleotides showed that toxicity is largely due to impurities in the oligonucleotide preparation and lack of specificity of the particular sequence used [13].

Undoubtedly, progress on antisense biotechnology will also result in a direct benefit to the model of computational genes.[citation needed]

References

  1. ^ Martinez-Perez, I.M., Zhang, G., Ignatova, Z., Zimmermann, K.-H.: Computational genes: a tool for molecular diagnosis and therapy of aberrant mutational phenotype. BMC Bioinformatics, 8:365, 2007. [1]
  2. ^ Zimmermann, K.-H., Ignatova, Z., Martinez-Perez, I.M.: Rechengen. Deutsches Patent, No. 102006009000, 2007.
  3. ^ Martinez-Perez, I.M.: Biomolecular computing models for graph problems and finite state automata. Ph.D. Thesis, Hamburg University of Technology, Hamburg, Germany, 2007. ISBN 978-3-86664-326-0.
  4. ^ “Smart Vaccines” - The Shape of Things to Come Research Interests, Joshua E. Mendoza-Elias
  5. ^ Montesano, R., Hainaut, P., Wild, C.P.: Hepatocellular carcinoma: from gene to public health. J Natl Cancer Inst, 89:1844-1851, 1997. [2]
  6. ^ Jackson, P.E., Kuang, S.Y., Wang, J.B., Strickland, P.T., Munoz, A., Kensler, T.V., Quian, G.V., Groopman, J.D.: Prospective detection of codon 249 mutations in plasma of hepatocellular carcinoma patients. Carcinogenesis, 24:1657-63, 2003. [3]
  7. ^ Friedler, A., Hanson, L.O., Veprintsev, D.B., Freund, S., Rippin, T.M., Nikolova, P.K., Proctor, M.R., Rdiger, S., Fersht, A.R.: A peptide that binds and stabilizes p53 core domain: Chaperone strategy for rescue of oncogenic mutants. Proc Natl Acad Sci, 99:937-942, 2002. [4]
  8. ^ Lambert, G., Fattal, E., Couvreur, P.: Nanoparticulate systems for the delivery of antisense oligonucleotides. Adv Drug Deliv Rev, 47:99-112, 2001. [5]
  9. ^ Aanta, M.A., Belguise-Valladier, P., Behr, J.P.: Gene delivery: a single nuclear localization signal peptide is sufficient to carry DNA to the cell nucleus. Proc Natl Acad Sci USA, 96:91-96, 1999. [6]
  10. ^ Miller, P., Tso, P.O.: A new approach to chemotherapy based on molecular biology and nucleic acid chemistry: Matagen (masking tape for gene expression). Anticancer Drug Res, 2:117-128, 1987. [7]
  11. ^ Stec, W.J., Zon, G., Egan, W., Stec, B.: Automated solid-phase synthesis, separation, and stereochemistry of phosphorothioate analogues of oligodeoxyribonucleotides. J Am Chem Soc, 106:6077-6080, 1984. [8]
  12. ^ Brysch, W., Schlingensiepen, K.H.: Design and applications of antisense oligonucleotides in cell culture, in vivo, and as therapeutic agents. Cellular and Molecular Neurobiology, 14:557-568, 1994. [9]
  13. ^ Lebedva, I., Stein, C.A.: Antisense oligonucleotides: Promise and reality. Annu Rev Pharmacol Toxicol, 41:403-419, 2001. [10]

See also


Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • Gene prediction — Gene finding typically refers to the area of computational biology that is concerned with algorithmically identifying stretches of sequence, usually genomic DNA, that are biologically functional. This especially includes protein coding genes, but …   Wikipedia

  • Computational — may refer to: Computer Computational algebra Computational Aeroacoustics Computational and Information Systems Laboratory Computational and Systems Neuroscience Computational archaeology Computational auditory scene analysis Computational biology …   Wikipedia

  • Computational genomics — refers to the use of computational analysis to decipher biology from genome sequences and related data [1], including both DNA and RNA sequence as well as other post genomic data (i.e. experimental data obtained with technologies that require the …   Wikipedia

  • Computational phylogenetics — is the application of computational algorithms, methods and programs to phylogenetic analyses. The goal is to assemble a phylogenetic tree representing a hypothesis about the evolutionary ancestry of a set of genes, species, or other taxa. For… …   Wikipedia

  • Computational epigenetics — Computational epigenetics[1] [2] uses bioinformatic methods[clarification needed] to complement experimental research in epigenetics. Due to the recent explosion of epigenome datasets, computational methods play an increasing role in all areas of …   Wikipedia

  • Computational Resource for Drug Discovery (CRDD) — Computational Resources for Drug Discovery (CRDD) is one of the important silico modules of Open Source for Drug Discovery (OSDD). The CRDD web portal provides computer resources related to drug discovery on a single platform. Following are major …   Wikipedia

  • Computational neuroscience — is the study of brain function in terms of the information processing properties of the structures that make up the nervous system.[1] It is an interdisciplinary science that links the diverse fields of neuroscience, cognitive science and… …   Wikipedia

  • Computational systems biology — is the algorithm and application development arm of systems biology. It is also directly associated with bioinformatics and computational biology. Computational systems biology aims to develop and use efficient algorithms, data structures and… …   Wikipedia

  • Gene Myers — is a computer scientist whose research focuses on algorithms and computational biology. Gene is currently group leader at the new Janelia Farm Research Campus of the Howard Hughes Medical Institute. Gene came to the JFRC from the University of… …   Wikipedia

  • Gene expression programming — (GEP) is an evolutionary algorithm that evolves populations of computer programs in order to solve a user defined problem. GEP has similarities, but is distinct to, the evolutionary computational method of Genetic Programming. In Genetic… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”