Optimization of particle bombardment parameters for the genetic transformation of Brazilian maize inbred lines

The objective of this work was to develop a genetic transformation system for tropical maize genotypes via particle bombardment of immature zygotic embryos. Particle bombardment was carried out using a genetic construct with bar and uidA genes under control of CaMV35S promoter. The best conditions to transform maize tropical inbred lines L3 and L1345 were obtained when immature embryos were cultivated, prior to the bombardment, in higher osmolarity during 4 hours and bombarded at an acceleration helium gas pressure of 1,100 psi, two shots per plate, and a microcarrier flying distance of 6.6 cm. Transformation frequencies obtained using these conditions ranged from 0.9 to 2.31%. Integration of foreign genes into the genome of maize plants was confirmed by Southern blot analysis as well as bar and uidA gene expressions. The maize genetic transformation protocol developed in this work will possibly improve the efficiency to produce new transgenic tropical maize lines expressing desirable agronomic characteristics.

Suprachoroidal electrotransfer: a nonviral gene delivery method to transfect the choroid and the retina without detaching the retina.

Photoreceptors and retinal pigment epithelial cells (RPE) targeting remains challenging in ocular gene therapy. Viral gene transfer, the only method having reached clinical evaluation, still raises safety concerns when administered via subretinal injections. We have developed a novel transfection method in the adult rat, called suprachoroidal electrotransfer (ET), combining the administration of nonviral plasmid DNA into the suprachoroidal space with the application of an electrical field. Optimization of injection, electrical parameters and external electrodes geometry using a reporter plasmid, resulted in a large area of transfected tissues. Not only choroidal cells but also RPE, and potentially photoreceptors, were efficiently transduced for at least a month when using a cytomegalovirus (CMV) promoter. No ocular complications were recorded by angiographic, electroretinographic, and histological analyses, demonstrating that under selected conditions the procedure is devoid of side effects on the retina or the vasculature integrity. Moreover, a significant inhibition of laser induced-choroidal neovascularization (CNV) was achieved 15 days after transfection of a soluble vascular endothelial growth factor receptor-1 (sFlt-1)-encoding plasmid. This is the first nonviral gene transfer technique that is efficient for RPE targeting without inducing retinal detachment. This novel minimally invasive nonviral gene therapy method may open new prospects for human retinal therapies.

Optimization strategies for fast detection of positive selection on phylogenetic trees.

MOTIVATION: The detection of positive selection is widely used to study gene and genome evolution, but its application remains limited by the high computational cost of existing implementations. We present a series of computational optimizations for more efficient estimation of the likelihood function on large-scale phylogenetic problems. We illustrate our approach using the branch-site model of codon evolution. RESULTS: We introduce novel optimization techniques that substantially outperform both CodeML from the PAML package and our previously optimized sequential version SlimCodeML. These techniques can also be applied to other likelihood-based phylogeny software. Our implementation scales well for large numbers of codons and/or species. It can therefore analyse substantially larger datasets than CodeML. We evaluated FastCodeML on different platforms and measured average sequential speedups of FastCodeML (single-threaded) versus CodeML of up to 5.8, average speedups of FastCodeML (multi-threaded) versus CodeML on a single node (shared memory) of up to 36.9 for 12 CPU cores, and average speedups of the distributed FastCodeML versus CodeML of up to 170.9 on eight nodes (96 CPU cores in total).Availability and implementation: ftp://ftp.vital-it.ch/tools/FastCodeML/. CONTACT: selectome@unil.ch or nicolas.salamin@unil.ch.

Algorithmic Techniques in Gene Expression Processing. From Imputation to Visualization

The amount of biological data has grown exponentially in recent decades. Modern biotechnologies, such as microarrays and next-generation sequencing, are capable to produce massive amounts of biomedical data in a single experiment. As the amount of the data is rapidly growing there is an urgent need for reliable computational methods for analyzing and visualizing it. This thesis addresses this need by studying how to efficiently and reliably analyze and visualize high-dimensional data, especially that obtained from gene expression microarray experiments. First, we will study the ways to improve the quality of microarray data by replacing (imputing) the missing data entries with the estimated values for these entries. Missing value imputation is a method which is commonly used to make the original incomplete data complete, thus making it easier to be analyzed with statistical and computational methods. Our novel approach was to use curated external biological information as a guide for the missing value imputation. Secondly, we studied the effect of missing value imputation on the downstream data analysis methods like clustering. We compared multiple recent imputation algorithms against 8 publicly available microarray data sets. It was observed that the missing value imputation indeed is a rational way to improve the quality of biological data. The research revealed differences between the clustering results obtained with different imputation methods. On most data sets, the simple and fast k-NN imputation was good enough, but there were also needs for more advanced imputation methods, such as Bayesian Principal Component Algorithm (BPCA). Finally, we studied the visualization of biological network data. Biological interaction networks are examples of the outcome of multiple biological experiments such as using the gene microarray techniques. Such networks are typically very large and highly connected, thus there is a need for fast algorithms for producing visually pleasant layouts. A computationally efficient way to produce layouts of large biological interaction networks was developed. The algorithm uses multilevel optimization within the regular force directed graph layout algorithm.

Optimization of the RNeasy Mini Kit to obtain high-quality total RNA from sessile cells of Staphylococcus aureus

Biofilm formed by Staphylococcus aureus is considered an important virulence trait in the pathogenesis of infections associated with implantable medical devices. Gene expression analyses are important strategies for determining the mechanisms involved in production and regulation of biofilm. Obtaining intact RNA preparations is the first and most critical step for these studies. In this article, we describe an optimized protocol for obtaining total RNA from sessile cells of S. aureus using the RNeasy Mini Kit. This method essentially consists of a few steps, as follows: 1) addition of acetone-ethanol to sessile cells, 2) lysis with lysostaphin at 37°C/10 min, 3) vigorous mixing, 4) three cycles of freezing and thawing, and 5) purification of the lysate in the RNeasy column. This simple pre-kit procedure yields high-quality total RNA from planktonic and sessile cells of S. aureus.

(A) Optimization of solid body phase synthesis of RNA using the Cpep chemistry. (B) Synthesis of BODIPY labeled oligonucleotides

(A) Solid phase synthesis of oligonucleotides are well documented and are extensively studied as the demands continue to rise with the development of antisense, anti-gene, RNA interference, and aptamers. Although synthesis of RNA sequences faces many challenges, most notably the choice of the 2' -hydroxy protecting group, modified 2' -O-Cpep protected ribonucleotides were synthesized as alternitive building blocks. Altering phosphitylation procedures to incorporate 3' -N,N-diethyl phosphoramidites enhanced the overall reactivity, thus, increased the coupling efficiency without loss of integrety. Furthermore, technical optimizations of solid phase synthesis cycles were carried out to allow for successful synthesis of a homo UIO sequences with a stepwise coupling efficiency reaching 99% and a final yield of 91 %. (B) Over the past few decades, dipyrrometheneboron difluoride (BODIPY) has gained recognition as one of the most versatile fluorophores. Currently, BODIPY labeling of oligonucleotides are carried out post-synthetically and to date, there lacks a method that allows for direct incorporation of BODIPY into oligonucleotides during solid phase synthesis. Therefore, synthesis of BODIPY derived phosphoramidites will provide an alternative method in obtaining fluorescently labelled oligonucleotides. A method for the synthesis and incorporation of the BODIPY analogues into oligonucleotides by phosphoramidite chemistry-based solid phase DNA synthesis is reported here. Using this approach, BODIPY-labeled TlO homopolymer and ISIS 5132 were successfully synthesized.

A Study of Ordered Gene Problems Featuring DNA Error Correction and DNA Fragment Assembly with a Variety of Heuristics, Genetic Algorithm Variations, and Dynamic Representations

Ordered gene problems are a very common classification of optimization problems. Because of their popularity countless algorithms have been developed in an attempt to find high quality solutions to the problems. It is also common to see many different types of problems reduced to ordered gene style problems as there are many popular heuristics and metaheuristics for them due to their popularity. Multiple ordered gene problems are studied, namely, the travelling salesman problem, bin packing problem, and graph colouring problem. In addition, two bioinformatics problems not traditionally seen as ordered gene problems are studied: DNA error correction and DNA fragment assembly. These problems are studied with multiple variations and combinations of heuristics and metaheuristics with two distinct types or representations. The majority of the algorithms are built around the Recentering- Restarting Genetic Algorithm. The algorithm variations were successful on all problems studied, and particularly for the two bioinformatics problems. For DNA Error Correction multiple cases were found with 100% of the codes being corrected. The algorithm variations were also able to beat all other state-of-the-art DNA Fragment Assemblers on 13 out of 16 benchmark problem instances.

Mean Squared Residue Based Biclustering Algorithms for the Analysis of Gene Expression Data

Computational Biology is the research are that contributes to the analysis of biological data through the development of algorithms which will address significant research problems.The data from molecular biology includes DNA,RNA ,Protein and Gene expression data.Gene Expression Data provides the expression level of genes under different conditions.Gene expression is the process of transcribing the DNA sequence of a gene into mRNA sequences which in turn are later translated into proteins.The number of copies of mRNA produced is called the expression level of a gene.Gene expression data is organized in the form of a matrix. Rows in the matrix represent genes and columns in the matrix represent experimental conditions.Experimental conditions can be different tissue types or time points.Entries in the gene expression matrix are real values.Through the analysis of gene expression data it is possible to determine the behavioral patterns of genes such as similarity of their behavior,nature of their interaction,their respective contribution to the same pathways and so on. Similar expression patterns are exhibited by the genes participating in the same biological process.These patterns have immense relevance and application in bioinformatics and clinical research.Theses patterns are used in the medical domain for aid in more accurate diagnosis,prognosis,treatment planning.drug discovery and protein network analysis.To identify various patterns from gene expression data,data mining techniques are essential.Clustering is an important data mining technique for the analysis of gene expression data.To overcome the problems associated with clustering,biclustering is introduced.Biclustering refers to simultaneous clustering of both rows and columns of a data matrix. Clustering is a global whereas biclustering is a local model.Discovering local expression patterns is essential for identfying many genetic pathways that are not apparent otherwise.It is therefore necessary to move beyond the clustering paradigm towards developing approaches which are capable of discovering local patterns in gene expression data.A biclusters is a submatrix of the gene expression data matrix.The rows and columns in the submatrix need not be contiguous as in the gene expression data matrix.Biclusters are not disjoint.Computation of biclusters is costly because one will have to consider all the combinations of columans and rows in order to find out all the biclusters.The search space for the biclustering problem is 2 m+n where m and n are the number of genes and conditions respectively.Usually m+n is more than 3000.The biclustering problem is NP-hard.Biclustering is a powerful analytical tool for the biologist.The research reported in this thesis addresses the problem of biclustering.Ten algorithms are developed for the identification of coherent biclusters from gene expression data.All these algorithms are making use of a measure called mean squared residue to search for biclusters.The objective here is to identify the biclusters of maximum size with the mean squared residue lower than a given threshold. All these algorithms begin the search from tightly coregulated submatrices called the seeds.These seeds are generated by K-Means clustering algorithm.The algorithms developed can be classified as constraint based,greedy and metaheuristic.Constarint based algorithms uses one or more of the various constaints namely the MSR threshold and the MSR difference threshold.The greedy approach makes a locally optimal choice at each stage with the objective of finding the global optimum.In metaheuristic approaches particle Swarm Optimization(PSO) and variants of Greedy Randomized Adaptive Search Procedure(GRASP) are used for the identification of biclusters.These algorithms are implemented on the Yeast and Lymphoma datasets.Biologically relevant and statistically significant biclusters are identified by all these algorithms which are validated by Gene Ontology database.All these algorithms are compared with some other biclustering algorithms.Algorithms developed in this work overcome some of the problems associated with the already existing algorithms.With the help of some of the algorithms which are developed in this work biclusters with very high row variance,which is higher than the row variance of any other algorithm using mean squared residue, are identified from both Yeast and Lymphoma data sets.Such biclusters which make significant change in the expression level are highly relevant biologically.

Bacillus lehensis-an alkali-tolerant bacterium isolated from cassava starch wastewater: optimization of parameters for cyclodextrin glycosyltransferase production

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

A phylogenetic analysis of Pleurodema (Anura: Leptodactylidae: Leiuperinae) based on mitochondrial and nuclear gene sequences, with comments on the evolution of anuran foam nests

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

A GEP-ISFG collaborative study on the optimization of an X-STR decaplex: data on 15 Iberian and Latin American populations

In a collaborative work carried out by the Spanish and Portuguese ISFG Working Group (GEP-ISFG), a polymerase chain reaction multiplex was optimized in order to type ten X-chromosome short tandem repeats (STRs) in a single reaction, including: DXS8378, DXS9902, DXS7132, DXS9898, DXS6809, DXS6789, DXS7133, GATA172D05, GATA31E08, and DXS7423. Using this X-decaplex, each 17 of the participating laboratories typed a population sample of approximately 200 unrelated individuals (100 males and 100 females). In this work, we report the allele frequencies for the ten X-STRs in 15 samples from Argentina (Buenos Aires, CA(3)rdoba, Rio Negro, Entre Rios, and Misiones), Brazil (SA o pound Paulo, Rio de Janeiro, Parana, and Mato Grosso do Sul), Colombia (Antioquia), Costa Rica, Portugal (Northern and Central regions), and Spain (Galicia and Cantabria). Gene diversities were calculated for the ten markers in each population and all values were above 56%. The average diversity per locus varied between 66%, for DXS7133, and 82%, for DXS6809. For this set of STRs, a high discrimination power was obtained in all populations, both in males (a parts per thousand yen1 in 5 A- 10(5)) and females (a parts per thousand yen1 in 3 A- 10(9)), as well as high mean exclusion chance in father/daughter duos (a parts per thousand yen99.953%) and in father/mother/daughter trios (a parts per thousand yen99.999%). Genetic distance analysis showed no significant differences between northern and central Portugal or between the two Spanish samples from Galicia and Cantabria. Inside Brazil, significant differences were found between Rio de Janeiro and the other three populations, as well as between SA o pound Paulo and Parana. For the five Argentinean samples, significant distances were only observed when comparing Misiones with Entre Rios and with Rio Negro, the only two samples that do not differ significantly from Costa Rica. Antioquia differed from all other samples, except the one from Rio Negro.

MedVir: 3D visual interface applied to gene profile analysis

The use of data mining techniques for the gene profile discovery of diseases, such as cancer, is becoming usual in many researches. These techniques do not usually analyze the relationships between genes in depth, depending on the different variety of manifestations of the disease (related to patients). This kind of analysis takes a considerable amount of time and is not always the focus of the research. However, it is crucial in order to generate personalized treatments to fight the disease. Thus, this research focuses on finding a mechanism for gene profile analysis to be used by the medical and biologist experts. Results: In this research, the MedVir framework is proposed. It is an intuitive mechanism based on the visualization of medical data such as gene profiles, patients, clinical data, etc. MedVir, which is based on an Evolutionary Optimization technique, is a Dimensionality Reduction (DR) approach that presents the data in a three dimensional space. Furthermore, thanks to Virtual Reality technology, MedVir allows the expert to interact with the data in order to tailor it to the experience and knowledge of the expert.

Understanding human genome regulation through entropic graph-based regularization and submodular optimization

Thesis (Ph.D.)--University of Washington, 2016-06

In vivo gene expression: DNA electrotransfer

The use of electric pulses to deliver therapeutic molecules to tissues and organs in vivo is a rapidly growing field of research. Electrotransfer can be used to deliver a wide range of potentially therapeutic agents, including drugs, proteins, oligonucleotides, RNA and DNA. Optimization of this approach depends upon a number of parameters such as target organ accessibility, cell turnover, microelectrode design, electric pulsing protocols and the physiological response to the therapeutic agent. Many organs have been successfully transfected by electroporation, including skin, liver, skeletal and cardiac muscle, male and female germ cells, artery, gut, kidney, retinal ganglion cells, cornea, spinal cord, joint synovium and brain. Electrotransfer technology is relevant in a variety of research and clinical settings including cancer therapy, modulation of pathogenic immune reactions, delivery of therapeutic proteins and drugs, and the identification of drug targets by the modulation of normal gene expression. This, together with the capacity to deliver very large DNA constructs, greatly expands the research and clinical applications of in vivo DNA electrotransfer.

Exploring ant-based algorithms for gene expression data analysis

Objective: Recently, much research has been proposed using nature inspired algorithms to perform complex machine learning tasks. Ant colony optimization (ACO) is one such algorithm based on swarm intelligence and is derived from a model inspired by the collective foraging behavior of ants. Taking advantage of the ACO in traits such as self-organization and robustness, this paper investigates ant-based algorithms for gene expression data clustering and associative classification. Methods and material: An ant-based clustering (Ant-C) and an ant-based association rule mining (Ant-ARM) algorithms are proposed for gene expression data analysis. The proposed algorithms make use of the natural behavior of ants such as cooperation and adaptation to allow for a flexible robust search for a good candidate solution. Results: Ant-C has been tested on the three datasets selected from the Stanford Genomic Resource Database and achieved relatively high accuracy compared to other classical clustering methods. Ant-ARM has been tested on the acute lymphoblastic leukemia (ALL)/acute myeloid leukemia (AML) dataset and generated about 30 classification rules with high accuracy. Conclusions: Ant-C can generate optimal number of clusters without incorporating any other algorithms such as K-means or agglomerative hierarchical clustering. For associative classification, while a few of the well-known algorithms such as Apriori, FP-growth and Magnum Opus are unable to mine any association rules from the ALL/AML dataset within a reasonable period of time, Ant-ARM is able to extract associative classification rules.