BIO-INSPIRED COMPUTATIONAL TECHNIQUES APPLIED TO THE CLUSTERING AND VISUALIZATION OF SPATIO-TEMPORAL GEOSPATIAL DATA

The coverage and volume of geo-referenced datasets are extensive and incessantly¦growing. The systematic capture of geo-referenced information generates large volumes¦of spatio-temporal data to be analyzed. Clustering and visualization play a key¦role in the exploratory data analysis and the extraction of knowledge embedded in¦these data. However, new challenges in visualization and clustering are posed when¦dealing with the special characteristics of this data. For instance, its complex structures,¦large quantity of samples, variables involved in a temporal context, high dimensionality¦and large variability in cluster shapes.¦The central aim of my thesis is to propose new algorithms and methodologies for¦clustering and visualization, in order to assist the knowledge extraction from spatiotemporal¦geo-referenced data, thus improving making decision processes.¦I present two original algorithms, one for clustering: the Fuzzy Growing Hierarchical¦Self-Organizing Networks (FGHSON), and the second for exploratory visual data analysis:¦the Tree-structured Self-organizing Maps Component Planes. In addition, I present¦methodologies that combined with FGHSON and the Tree-structured SOM Component¦Planes allow the integration of space and time seamlessly and simultaneously in¦order to extract knowledge embedded in a temporal context.¦The originality of the FGHSON lies in its capability to reflect the underlying structure¦of a dataset in a hierarchical fuzzy way. A hierarchical fuzzy representation of¦clusters is crucial when data include complex structures with large variability of cluster¦shapes, variances, densities and number of clusters. The most important characteristics¦of the FGHSON include: (1) It does not require an a-priori setup of the number¦of clusters. (2) The algorithm executes several self-organizing processes in parallel.¦Hence, when dealing with large datasets the processes can be distributed reducing the¦computational cost. (3) Only three parameters are necessary to set up the algorithm.¦In the case of the Tree-structured SOM Component Planes, the novelty of this algorithm¦lies in its ability to create a structure that allows the visual exploratory data analysis¦of large high-dimensional datasets. This algorithm creates a hierarchical structure¦of Self-Organizing Map Component Planes, arranging similar variables' projections in¦the same branches of the tree. Hence, similarities on variables' behavior can be easily¦detected (e.g. local correlations, maximal and minimal values and outliers).¦Both FGHSON and the Tree-structured SOM Component Planes were applied in¦several agroecological problems proving to be very efficient in the exploratory analysis¦and clustering of spatio-temporal datasets.¦In this thesis I also tested three soft competitive learning algorithms. Two of them¦well-known non supervised soft competitive algorithms, namely the Self-Organizing¦Maps (SOMs) and the Growing Hierarchical Self-Organizing Maps (GHSOMs); and the¦third was our original contribution, the FGHSON. Although the algorithms presented¦here have been used in several areas, to my knowledge there is not any work applying¦and comparing the performance of those techniques when dealing with spatiotemporal¦geospatial data, as it is presented in this thesis.¦I propose original methodologies to explore spatio-temporal geo-referenced datasets¦through time. Our approach uses time windows to capture temporal similarities and¦variations by using the FGHSON clustering algorithm. The developed methodologies¦are used in two case studies. In the first, the objective was to find similar agroecozones¦through time and in the second one it was to find similar environmental patterns¦shifted in time.¦Several results presented in this thesis have led to new contributions to agroecological¦knowledge, for instance, in sugar cane, and blackberry production.¦Finally, in the framework of this thesis we developed several software tools: (1)¦a Matlab toolbox that implements the FGHSON algorithm, and (2) a program called¦BIS (Bio-inspired Identification of Similar agroecozones) an interactive graphical user¦interface tool which integrates the FGHSON algorithm with Google Earth in order to¦show zones with similar agroecological characteristics.

Convergent genetic architecture underlies social organization in ants.

Complex adaptive polymorphisms are common in nature, but what mechanisms maintain the underlying favorable allelic combinations [1-4]? The convergent evolution of polymorphic social organization in two independent ant species provides a great opportunity to investigate how genomes evolved under parallel selection. Here, we demonstrate that a large, nonrecombining "social chromosome" is associated with social organization in the Alpine silver ant, Formica selysi. This social chromosome shares architectural characteristics with that of the fire ant Solenopsis invicta [2], but the two show no detectable similarity in gene content. The discovery of convergence at two levels-the phenotype and the genetic architecture associated with alternative social forms-points at general genetic mechanisms underlying transitions in social organization. More broadly, our findings are consistent with recent theoretical studies suggesting that suppression of recombination plays a key role in facilitating coordinated shifts in coadapted traits [5, 6].

Computational problems in perfect phylogeny haplotyping: typing without calling the allele.

A haplotype is an m-long binary vector. The XOR-genotype of two haplotypes is the m-vector of their coordinate-wise XOR. We study the following problem: Given a set of XOR-genotypes, reconstruct their haplotypes so that the set of resulting haplotypes can be mapped onto a perfect phylogeny (PP) tree. The question is motivated by studying population evolution in human genetics, and is a variant of the perfect phylogeny haplotyping problem that has received intensive attention recently. Unlike the latter problem, in which the input is "full" genotypes, here we assume less informative input, and so may be more economical to obtain experimentally. Building on ideas of Gusfield, we show how to solve the problem in polynomial time, by a reduction to the graph realization problem. The actual haplotypes are not uniquely determined by that tree they map onto, and the tree itself may or may not be unique. We show that tree uniqueness implies uniquely determined haplotypes, up to inherent degrees of freedom, and give a sufficient condition for the uniqueness. To actually determine the haplotypes given the tree, additional information is necessary. We show that two or three full genotypes suffice to reconstruct all the haplotypes, and present a linear algorithm for identifying those genotypes.

Computational calculations of magnetic relaxation and viscosity in small magnetic grains

In this article we present a phenomenological model which simulates very well the mag¿ netic relaxation behavior experimentally observed in small magnetic grains and single domain particles. In this model, the occurrence of quantum tunneling of magnetization below a certain temperature is taken into account. Experimental results for different materials are presented to illustrate the most important behavior deduced from our model

Lack of Enantioselectivity in the SULT1A3-catalyzed Sulfoconjugation of Normetanephrine Enantiomers: An In Vitro and Computational Study.

(1R)-Normetanephrine is the natural stereoisomeric substrate for sulfotransferase 1A3 (SULT1A3)-catalyzed sulfonation. Nothing appears known on the enantioselectivity of the reaction despite its potential significance in the metabolism of adrenergic amines and in clinical biochemistry. We confronted the kinetic parameters of the sulfoconjugation of synthetic (1R)-normetanephrine and (1S)-normetanephrine by recombinant human SULT1A3 to a docking model of each normetanephrine enantiomer with SULT1A3 and the 3'-phosphoadenosine-5'-phosphosulfate cofactor on the basis of molecular modeling and molecular dynamics simulations of the stability of the complexes. The K(M) , V(max) , and k(cat) values for the sulfonation of (1R)-normetanephrine, (1S)-normetanephrine, and racemic normetanephrine were similar. In silico models were consistent with these findings as they showed that the binding modes of the two enantiomers were almost identical. In conclusion, SULT1A3 is not substrate-enantioselective toward normetanephrine, an unexpected finding explainable by a mutual adaptability between the ligands and SULT1A3 through an "induced-fit model" in the catalytic pocket. Chirality, 00:000-000, 2012.© 2012 Wiley Periodicals, Inc.