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.

Forest sector simulation models as methodological tools in forest policy analysis.

XVIII IUFRO World Congress, Ljubljana 1986.

Open-source tools for enhancing full-text searching of OPACs Use of Koha, Greenstone and Fedora

Purpose - There are many library automation packages available as open-source software, comprising two modules: staff-client module and online public access catalogue (OPAC). Although the OPAC of these library automation packages provides advanced features of searching and retrieval of bibliographic records, none of them facilitate full-text searching. Most of the available open-source digital library software facilitates indexing and searching of full-text documents in different formats. This paper makes an effort to enable full-text search features in the widely used open-source library automation package Koha, by integrating it with two open-source digital library software packages, Greenstone Digital Library Software (GSDL) and Fedora Generic Search Service (FGSS), independently. Design/methodology/approach - The implementation is done by making use of the Search and Retrieval by URL (SRU) feature available in Koha, GSDL and FGSS. The full-text documents are indexed both in Koha and GSDL and FGSS. Findings - Full-text searching capability in Koha is achieved by integrating either GSDL or FGSS into Koha and by passing an SRU request to GSDL or FGSS from Koha. The full-text documents are indexed both in the library automation package (Koha) and digital library software (GSDL, FGSS) Originality/value - This is the first implementation enabling the full-text search feature in a library automation software by integrating it into digital library software.

A Flexure-based Deployable Stereo Vision Mechanism and Temperature and Force Sensors for Laparoscopic Tools

This paper presents concepts, designs, and working prototypes of enhanced laparoscopic surgical tools. The enhancements are in equipping the tool with force and temperature sensing as well as image acquisition for stereo vision. Just as the pupils of our eyes are adequately spaced out and the distance between them is adjustable, two minute cameras mounted on a mechanism in our design can be moved closer or farther apart inside the inflated abdomen during the surgery. The cameras are fitted to a deployable mechanism consisting of flexural joints so that they can be inserted through a small incision and then deployed and moved as needed.A temperature sensor and a force sensor are mounted on either of the gripping faces of the surgical grasping tool to measure the temperature and gripping force, which need to be controlled for safe laparoscopic surgery. The sensors are small enough and hence they do not cause interference during surgery and insertion.Prototyping and working of the enhanced laparoscopic tool are presented with details

Oneand twodimensional single quantumand multiplequantumNMR methodologies: tools for chiral analyses

It is well known that enantiomers cannot be distinguished by NMR spectroscopy unless diastereomorphic interactions are imposed. Several chiral aligning media have therefore been reported for their visualization, although extensive studies are carried out using the liquid crystal made of polypeptide poly-γ-benzyl-L-glutamate (PBLG) in organic solvent. In PBLG medium the spin systems are weakly coupled and the first order analyses of the spectra are generally possible. But due to large number of pair wise interactions of nuclear spins resulting in many degenerate transitions the 1H NMR spectra are not only complex but also broad and featureless, in addition to an indistinguishable overlap of the spectra of enantiomers. This enormous loss of resolution severely hinders the analyses of proton spectra, even for spin systems with 5–6 interacting protons, thereby restricting itsroutine application. In this review we discuss our recently developed several one and multidimensional NMR experiments to circumvent these difficulties taking specific examples of the molecules containing a single chiral centre.

DMT of Multihop Networks: End Points and Computational Tools

In this paper, the diversity-multiplexing gain tradeoff (DMT) of single-source, single-sink (ss-ss), multihop relay networks having slow-fading links is studied. In particular, the two end-points of the DMT of ss-ss full-duplex networks are determined, by showing that the maximum achievable diversity gain is equal to the min-cut and that the maximum multiplexing gain is equal to the min-cut rank, the latter by using an operational connection to a deterministic network. Also included in the paper, are several results that aid in the computation of the DMT of networks operating under amplify-and-forward (AF) protocols. In particular, it is shown that the colored noise encountered in amplify-and-forward protocols can be treated as white for the purpose of DMT computation, lower bounds on the DMT of lower-triangular channel matrices are derived and the DMT of parallel MIMO channels is computed. All protocols appearing in the paper are explicit and rely only upon AF relaying. Half-duplex networks and explicit coding schemes are studied in a companion paper.