Simulation and graph mining tools for improving gene mapping efficiency

Gene mapping is a systematic search for genes that affect observable characteristics of an organism. In this thesis we offer computational tools to improve the efficiency of (disease) gene-mapping efforts. In the first part of the thesis we propose an efficient simulation procedure for generating realistic genetical data from isolated populations. Simulated data is useful for evaluating hypothesised gene-mapping study designs and computational analysis tools. As an example of such evaluation, we demonstrate how a population-based study design can be a powerful alternative to traditional family-based designs in association-based gene-mapping projects. In the second part of the thesis we consider a prioritisation of a (typically large) set of putative disease-associated genes acquired from an initial gene-mapping analysis. Prioritisation is necessary to be able to focus on the most promising candidates. We show how to harness the current biomedical knowledge for the prioritisation task by integrating various publicly available biological databases into a weighted biological graph. We then demonstrate how to find and evaluate connections between entities, such as genes and diseases, from this unified schema by graph mining techniques. Finally, in the last part of the thesis, we define the concept of reliable subgraph and the corresponding subgraph extraction problem. Reliable subgraphs concisely describe strong and independent connections between two given vertices in a random graph, and hence they are especially useful for visualising such connections. We propose novel algorithms for extracting reliable subgraphs from large random graphs. The efficiency and scalability of the proposed graph mining methods are backed by extensive experiments on real data. While our application focus is in genetics, the concepts and algorithms can be applied to other domains as well. We demonstrate this generality by considering coauthor graphs in addition to biological graphs in the experiments.

Physical mapping of the genomic DNA of the Oryctes rhinoceros baculovirus, KI

A non-occluded baculovirus, OBV-KI has been isolated from the insect pest, Oryctes rhinoceros. The viral genome is estimated to be 123 kb, with a G + C content of 43 mol% and no detectible methylated bases. A restriction map of the OBV-KI genome for BamHI, EcoRI, HindIII, PstI, SalI and XbaI has been constructed.

Mapping Road Infrastructure in Developing Countries Applying Remote Sensing and GIS - The Case of the Taita Hills, Kenya

Road transport and infrastructure has a fundamental meaning for the developing world. Poor quality and inadequate coverage of roads, lack of maintenance operations and outdated road maps continue to hinder economic and social development in the developing countries. This thesis focuses on studying the present state of road infrastructure and its mapping in the Taita Hills, south-east Kenya. The study is included as a part of the TAITA-project by the Department of Geography, University of Helsinki. The road infrastructure of the study area is studied by remote sensing and GIS based methodology. As the principal dataset, true colour airborne digital camera data from 2004, was used to generate an aerial image mosaic of the study area. Auxiliary data includes SPOT satellite imagery from 2003, field spectrometry data of road surfaces and relevant literature. Road infrastructure characteristics are interpreted from three test sites using pixel-based supervised classification, object-oriented supervised classifications and visual interpretation. Road infrastructure of the test sites is interpreted visually from a SPOT image. Road centrelines are then extracted from the object-oriented classification results with an automatic vectorisation process. The road infrastructure of the entire image mosaic is mapped by applying the most appropriate assessed data and techniques. The spectral characteristics and reflectance of various road surfaces are considered with the acquired field spectra and relevant literature. The results are compared with the experimented road mapping methods. This study concludes that classification and extraction of roads remains a difficult task, and that the accuracy of the results is inadequate regardless of the high spatial resolution of the image mosaic used in this thesis. Visual interpretation, out of all the experimented methods in this thesis is the most straightforward, accurate and valid technique for road mapping. Certain road surfaces have similar spectral characteristics and reflectance values with other land cover and land use. This has a great influence for digital analysis techniques in particular. Road mapping is made even more complicated by rich vegetation and tree canopy, clouds, shadows, low contrast between roads and surroundings and the width of narrow roads in relation to the spatial resolution of the imagery used. The results of this thesis may be applied to road infrastructure mapping in developing countries on a more general context, although with certain limits. In particular, unclassified rural roads require updated road mapping schemas to intensify road transport possibilities and to assist in the development of the developing world.

Novel gray coded pattern for unwrapping phase in fringe projection based 3D profiling

A method to reliably extract object profiles even with height discontinuities (that leads to 2n pi phase jumps) is proposed. This method uses Fourier transform profilometry to extract wrapped phase, and an additional image formed by illuminating the object of interest by a novel gray coded pattern for phase unwrapping. Simulation results suggest that the proposed approach not only retains the advantages of the original method, but also contributes significantly in the enhancement of its performance. Fundamental advantage of this method stems from the fact that both extraction of wrapped phase and unwrapping the same were done by gray scale images. Hence, unlike the methods that use colors, proposed method doesn't demand a color CCD camera and is ideal for profiling objects with multiple colors.

Measurement of complex optical flow with use of an augmented generalized gradient scheme

We present a method for measuring the local velocities and first-order variations in velocities in a timevarying image. The scheme is an extension of the generalized gradient model that encompasses the local variation of velocity within a local patch of the image. Motion within a patch is analyzed in parallel by 42 different spatiotemporal filters derived from 6 linearly independent spatiotemporal kernels. No constraints are imposed on the image structure, and there is no need for smoothness constraints on the velocity field. The aperture problem does not arise so long as there is some two-dimensional structure in the patch being analyzed. Among the advantages of the scheme is that there is no requirement to calculate second or higher derivatives of the image function. This makes the scheme robust in the presence of noise. The spatiotemporal kernels are of simple form, involving Gaussian functions, and are biologically plausible receptive fields. The validity of the scheme is demonstrated by application to both synthetic and real video images sequences and by direct comparison with another recently published scheme Biol. Cybern. 63, 185 (1990)] for the measurement of complex optical flow.

Measurement of complex optical flow with use of an augmented generalized gradient scheme

We present a method for measuring the local velocities and first-order variations in velocities in a time-varying image. The scheme is an extension of the generalized gradient model that encompasses the local variation of velocity within a local patch of the image. Motion within a patch is analyzed in parallel by 42 different spatiotemporal filters derived from 6 linearly independent spatiotemporal kernels. No constraints are imposed on the image structure, and there is no need for smoothness constraints on the velocity field. The aperture problem does not arise so long as there is some two-dimensional structure in the patch being analyzed. Among the advantages of the scheme is that there is no requirement to calculate second or higher derivatives of the image function. This makes the scheme robust in the presence of noise. The spatiotemporal kernels are of simple form, involving Gaussian functions, and are biologically plausible receptive fields. The validity of the scheme is demonstrated by application to both synthetic and real video images sequences and by direct comparison with another recently published scheme [Biol. Cybern. 63, 185 (1990)] for the measurement of complex optical flow.

Robust/Optimal Temperature Profile Control of a High-Speed Aerospace Vehicle Using Neural Networks

An approximate dynamic programming (ADP)-based suboptimal neurocontroller to obtain desired temperature for a high-speed aerospace vehicle is synthesized in this paper. A I-D distributed parameter model of a fin is developed from basic thermal physics principles. "Snapshot" solutions of the dynamics are generated with a simple dynamic inversion-based feedback controller. Empirical basis functions are designed using the "proper orthogonal decomposition" (POD) technique and the snapshot solutions. A low-order nonlinear lumped parameter system to characterize the infinite dimensional system is obtained by carrying out a Galerkin projection. An ADP-based neurocontroller with a dual heuristic programming (DHP) formulation is obtained with a single-network-adaptive-critic (SNAC) controller for this approximate nonlinear model. Actual control in the original domain is calculated with the same POD basis functions through a reverse mapping. Further contribution of this paper includes development of an online robust neurocontroller to account for unmodeled dynamics and parametric uncertainties inherent in such a complex dynamic system. A neural network (NN) weight update rule that guarantees boundedness of the weights and relaxes the need for persistence of excitation (PE) condition is presented. Simulation studies show that in a fairly extensive but compact domain, any desired temperature profile can be achieved starting from any initial temperature profile. Therefore, the ADP and NN-based controllers appear to have the potential to become controller synthesis tools for nonlinear distributed parameter systems.

A novel method for mapping assembled epitopes in batches: Identification of three epitopes at the receptor binding region of human chorionic gonadotropin

Identification of conformation-specific epitopes of hCG beta has been done using a simple batch method, Chemically or enzymatically-modified hCG beta has been prepared in a batch and the effect of modifications on the integrity of different epitope regions has been investigated in a quantitative manner using monoclonal antibodies (MAbs) immobilized on plastic tubes from culture supernatants. Based on the extent of damage done to different regions by different modifications, three conformation-specific epitopes of hCG beta have been identified. The method has been shown to have important advantages over the existing methods on many considerations, Using this approach, these epitopes have been shown to be at/near the receptor-binding region.

Antigenic determinants at the carboxy terminus of chicken egg white riboflavin carrier protein (RCP): Epitope mapping and antibody-mediated pregnancy curtailment in rodents

The epitopic core sequences recognized by three monoclonal antibodies raised to chicken riboflavin carrier protein (RCP) were mapped to the C-terminal tail-end of the protein using the pepscan method A 21-residue synthetic peptide corresponding to residues 200-219 of the protein and comprising the regions corresponding to the antibodies was synthesized. Administration of polyclonal antibodies specific to this peptide led to termination of early pregnancy in mice. Also, active immunization of rats with the peptide-purified protein derivative conjugate inhibited establishment of pregnancy. These results demonstrate the functional importance of the C-terminal 200-219 region of chicken RCP. Copyright (C) 1996 Elsevier Science Ltd.

RS and GIS in mapping of geomorphic records and understanding the local controls of glacial retreat from the Baspa Valley, Himachal Pradesh, India

We report here the role of remote sensing (RS) and geographical information system (GIS) in the identification of geomorphic records and understanding of the local controls on the retreat of glaciers of the Baspa Valley, Himachal Pradesh, India. The geomorphic records mapped are accumulation zone, exposed ablation zone, moraine-covered ablation zone, snout, deglaciated valley, lateral moraine, medial moraine, terminal moraine and hanging glacier. Details of these features and stages of deglaciation have been extracted from RS data and mapped in a GIS environment. Glacial geomorphic data have been generated for 22 glaciers of the Baspa Valley. The retreat of glaciers has been estimated using the glacial maxima observed on satellite images. On the basis of percentage of retreat and the critical analysis of glacial geomorphic data for 22 glaciers of the Baspa Valley, they are classified into seven categories of very low to very very high retreat. From the analysis of the above 22 glaciers, it has been found that other than global warming, the retreat of glaciers of the Baspa Valley is inversely proportional to the size of the accumulation zone and the ratio of the moraine covered ablation/exposed ablation zone.

Mapping adaptive resonance theory onto ring and mesh architectures

In recent years, parallel computers have been attracting attention for simulating artificial neural networks (ANN). This is due to the inherent parallelism in ANN. This work is aimed at studying ways of parallelizing adaptive resonance theory (ART), a popular neural network algorithm. The core computations of ART are separated and different strategies of parallelizing ART are discussed. We present mapping strategies for ART 2-A neural network onto ring and mesh architectures. The required parallel architecture is simulated using a parallel architectural simulator, PROTEUS and parallel programs are written using a superset of C for the algorithms presented. A simulation-based scalability study of the algorithm-architecture match is carried out. The various overheads are identified in order to suggest ways of improving the performance. Our main objective is to find out the performance of the ART2-A network on different parallel architectures. (C) 1999 Elsevier Science B.V. All rights reserved.

Mapping of B-cell epitopes of hemagglutinin protein of rinderpest virus

Monoclonal antibodies (mAbs) against secreted hemagglutinin (H) protein of rinderpest virus (RPV) expressed by a recombinant baculovirus were generated to characterize the antigenic sites on H protein and regions of functional significance. Three of the mAbs displayed hemagglutination inhibition activity and these mAbs were unable to neutralize virus infectivity. Western immunoblot analysis of overlapping deletion mutants indicated that three mAbs recognize antigenic regions at the extreme carboxy terminus (between amino acids 569 and 609) and the fourth mAb between amino acids 512 and 568. Using synthetic peptides, aa 569-577 and 575-583 were identified as the epitopes for E2G4 and D2F4, respectively. The epitopic domains of A12A9 and E2B6 mAbs were mapped to regions encompassing aa 527-554 and 588-609. Two epitopes spanning the extreme carboxy terminal region of aa 573 to 587 and 588 to 609 were shown to be immunodominant employing a competitive ELISA with polyclonal sera form vaccinated cattle. The D2F4 mAb which recognizes a unique epitope on RPV-H is not present on the closely related peste des petits ruminant virus FIN protein and this mAb could serve as a tool in the seromonitoring program after rinderpest vaccination. (C) 2002 Elsevier Science (USA).

The restriction mapping problem revisited

In computational molecular biology, the aim of restriction mapping is to locate the restriction sites of a given enzyme on a DNA molecule. Double digest and partial digest are two well-studied techniques for restriction mapping. While double digest is NP-complete, there is no known polynomial-time algorithm for partial digest. Another disadvantage of the above techniques is that there can be multiple solutions for reconstruction. In this paper, we study a simple technique called labeled partial digest for restriction mapping. We give a fast polynomial time (O(n(2) log n) worst-case) algorithm for finding all the n sites of a DNA molecule using this technique. An important advantage of the algorithm is the unique reconstruction of the DNA molecule from the digest. The technique is also robust in handling errors in fragment lengths which arises in the laboratory. We give a robust O(n(4)) worst-case algorithm that can provably tolerate an absolute error of O(Delta/n) (where Delta is the minimum inter-site distance), while giving a unique reconstruction. We test our theoretical results by simulating the performance of the algorithm on a real DNA molecule. Motivated by the similarity to the labeled partial digest problem, we address a related problem of interest-the de novo peptide sequencing problem (ACM-SIAM Symposium on Discrete Algorithms (SODA), 2000, pp. 389-398), which arises in the reconstruction of the peptide sequence of a protein molecule. We give a simple and efficient algorithm for the problem without using dynamic programming. The algorithm runs in time O(k log k), where k is the number of ions and is an improvement over the algorithm in Chen et al. (C) 2002 Elsevier Science (USA). All rights reserved.