Parallelization of web processing services on cloud computing: A case study of Geostatistical Methods

Dissertation submitted in partial fulfillment of the requirements for the Degree of Master of Science in Geospatial Technologies.

Adaptation from standing genetic variation and from mutation

Dissertation presented to obtain the Ph.D degree in Evolutionary Biology

Estimating data divergence in cloud computing storage systems

Dissertação para obtenção do Grau de Mestre em Engenharia Informática

Genetic basis of adaptation in Arabidopsis thaliana: local adaptation at the seed dormancy QTL DOG1.

Local adaptation provides an opportunity to study the genetic basis of adaptation and investigate the allelic architecture of adaptive genes. We study delay of germination 1 (DOG1), a gene controlling natural variation in seed dormancy in Arabidopsis thaliana and investigate evolution of dormancy in 41 populations distributed in four regions separated by natural barriers. Using F(ST) and Q(ST) comparisons, we compare variation at DOG1 with neutral markers and quantitative variation in seed dormancy. Patterns of genetic differentiation among populations suggest that the gene DOG1 contributes to local adaptation. Although Q(ST) for seed dormancy is not different from F(ST) for neutral markers, a correlation with variation in summer precipitation supports that seed dormancy is adaptive. We characterize dormancy variation in several F(2) -populations and show that a series of functionally distinct alleles segregate at the DOG1 locus. Theoretical models have shown that the number and effect of alleles segregatin at quantitative trait loci (QTL) have important consequences for adaptation. Our results provide support to models postulating a large number of alleles at quantitative trait loci involved in adaptation.

The M-Coffee web server: a meta-method for computing multiple sequence alignments by combining alternative alignment methods.

The M-Coffee server is a web server that makes it possible to compute multiple sequence alignments (MSAs) by running several MSA methods and combining their output into one single model. This allows the user to simultaneously run all his methods of choice without having to arbitrarily choose one of them. The MSA is delivered along with a local estimation of its consistency with the individual MSAs it was derived from. The computation of the consensus multiple alignment is carried out using a special mode of the T-Coffee package [Notredame, Higgins and Heringa (T-Coffee: a novel method for fast and accurate multiple sequence alignment. J. Mol. Biol. 2000; 302: 205-217); Wallace, O'Sullivan, Higgins and Notredame (M-Coffee: combining multiple sequence alignment methods with T-Coffee. Nucleic Acids Res. 2006; 34: 1692-1699)] Given a set of sequences (DNA or proteins) in FASTA format, M-Coffee delivers a multiple alignment in the most common formats. M-Coffee is a freeware open source package distributed under a GPL license and it is available either as a standalone package or as a web service from www.tcoffee.org.

Evolutionary computing in search-based software engineering

This master’s thesis aims to study and represent from literature how evolutionary algorithms are used to solve different search and optimisation problems in the area of software engineering. Evolutionary algorithms are methods, which imitate the natural evolution process. An artificial evolution process evaluates fitness of each individual, which are solution candidates. The next population of candidate solutions is formed by using the good properties of the current population by applying different mutation and crossover operations. Different kinds of evolutionary algorithm applications related to software engineering were searched in the literature. Applications were classified and represented. Also the necessary basics about evolutionary algorithms were presented. It was concluded, that majority of evolutionary algorithm applications related to software engineering were about software design or testing. For example, there were applications about classifying software production data, project scheduling, static task scheduling related to parallel computing, allocating modules to subsystems, N-version programming, test data generation and generating an integration test order. Many applications were experimental testing rather than ready for real production use. There were also some Computer Aided Software Engineering tools based on evolutionary algorithms.

The genetic basis of color-related local adaptation in a ring-like colonization around the Mediterranean.

Uncovering the genetic basis of phenotypic variation and the population history under which it established is key to understand the trajectories along which local adaptation evolves. Here, we investigated the genetic basis and evolutionary history of a clinal plumage color polymorphism in European barn owls (Tyto alba). Our results suggest that barn owls colonized the Western Palearctic in a ring-like manner around the Mediterranean and meet in secondary contact in Greece. Rufous coloration appears to be linked to a recently evolved nonsynonymous-derived variant of the melanocortin 1 receptor (MC1R) gene, which according to quantitative genetic analyses evolved under local adaptation during or following the colonization of Central Europe. Admixture patterns and linkage disequilibrium between the neutral genetic background and color found exclusively within the secondary contact zone suggest limited introgression at secondary contact. These results from a system reminiscent of ring species provide a striking example of how local adaptation can evolve from derived genetic variation.

“Reconstruction of Gene Regulatory Network from Expression Profile of Plasma RNA Data of Colorectal Cancer Patients using Soft Computing Techniques”

Microarray data analysis is one of data mining tool which is used to extract meaningful information hidden in biological data. One of the major focuses on microarray data analysis is the reconstruction of gene regulatory network that may be used to provide a broader understanding on the functioning of complex cellular systems. Since cancer is a genetic disease arising from the abnormal gene function, the identification of cancerous genes and the regulatory pathways they control will provide a better platform for understanding the tumor formation and development. The major focus of this thesis is to understand the regulation of genes responsible for the development of cancer, particularly colorectal cancer by analyzing the microarray expression data. In this thesis, four computational algorithms namely fuzzy logic algorithm, modified genetic algorithm, dynamic neural fuzzy network and Takagi Sugeno Kang-type recurrent neural fuzzy network are used to extract cancer specific gene regulatory network from plasma RNA dataset of colorectal cancer patients. Plasma RNA is highly attractive for cancer analysis since it requires a collection of small amount of blood and it can be obtained at any time in repetitive fashion allowing the analysis of disease progression and treatment response.

Evolving Classifiers - Evolutionary Algorithms in Data Mining

Data mining means to summarize information from large amounts of raw data. It is one of the key technologies in many areas of economy, science, administration and the internet. In this report we introduce an approach for utilizing evolutionary algorithms to breed fuzzy classifier systems. This approach was exercised as part of a structured procedure by the students Achler, Göb and Voigtmann as contribution to the 2006 Data-Mining-Cup contest, yielding encouragingly positive results.

Connectivity measures for internet topologies on the level of autonomous systems

Classical measures of network connectivity are the number of disjoint paths between a pair of nodes and the size of a minimum cut. For standard graphs, these measures can be computed efficiently using network flow techniques. However, in the Internet on the level of autonomous systems (ASs), referred to as AS-level Internet, routing policies impose restrictions on the paths that traffic can take in the network. These restrictions can be captured by the valley-free path model, which assumes a special directed graph model in which edge types represent relationships between ASs. We consider the adaptation of the classical connectivity measures to the valley-free path model, where it is -hard to compute them. Our first main contribution consists of presenting algorithms for the computation of disjoint paths, and minimum cuts, in the valley-free path model. These algorithms are useful for ASs that want to evaluate different options for selecting upstream providers to improve the robustness of their connection to the Internet. Our second main contribution is an experimental evaluation of our algorithms on four types of directed graph models of the AS-level Internet produced by different inference algorithms. Most importantly, the evaluation shows that our algorithms are able to compute optimal solutions to instances of realistic size of the connectivity problems in the valley-free path model in reasonable time. Furthermore, our experimental results provide information about the characteristics of the directed graph models of the AS-level Internet produced by different inference algorithms. It turns out that (i) we can quantify the difference between the undirected AS-level topology and the directed graph models with respect to fundamental connectivity measures, and (ii) the different inference algorithms yield topologies that are similar with respect to connectivity and are different with respect to the types of paths that exist between pairs of ASs.

Changes in physical activity following a genetic-based internet-delivered personalized intervention: randomized controlled trial (Food4Me)

Background: There is evidence that physical activity (PA) can attenuate the influence of the fat mass- and obesity-associated (FTO) genotype on the risk to develop obesity. However, whether providing personalized information on FTO genotype leads to changes in PA is unknown. Objective: The purpose of this study was to determine if disclosing FTO risk had an impact on change in PA following a 6-month intervention. Methods: The single nucleotide polymorphism (SNP) rs9939609 in the FTO gene was genotyped in 1279 participants of the Food4Me study, a four-arm, Web-based randomized controlled trial (RCT) in 7 European countries on the effects of personalized advice on nutrition and PA. PA was measured objectively using a TracmorD accelerometer and was self-reported using the Baecke questionnaire at baseline and 6 months. Differences in baseline PA variables between risk (AA and AT genotypes) and nonrisk (TT genotype) carriers were tested using multiple linear regression. Impact of FTO risk disclosure on PA change at 6 months was assessed among participants with inadequate PA, by including an interaction term in the model: disclosure (yes/no) × FTO risk (yes/no). Results: At baseline, data on PA were available for 874 and 405 participants with the risk and nonrisk FTO genotypes, respectively. There were no significant differences in objectively measured or self-reported baseline PA between risk and nonrisk carriers. A total of 807 (72.05%) of the participants out of 1120 in the personalized groups were encouraged to increase PA at baseline. Knowledge of FTO risk had no impact on PA in either risk or nonrisk carriers after the 6-month intervention. Attrition was higher in nonrisk participants for whom genotype was disclosed (P=.01) compared with their at-risk counterparts. Conclusions: No association between baseline PA and FTO risk genotype was observed. There was no added benefit of disclosing FTO risk on changes in PA in this personalized intervention. Further RCT studies are warranted to confirm whether disclosure of nonrisk genetic test results has adverse effects on engagement in behavior change.