GENEHUNTER: your 'one-stop shop' for statistical genetic analysis?

The past decade has brought a proliferation of statistical genetic (linkage) analysis techniques, incorporating new methodology and/or improvement of existing methodology in gene mapping, specifically targeted towards the localization of genes underlying complex disorders. Most of these techniques have been implemented in user-friendly programs and made freely available to the genetics community. Although certain packages may be more 'popular' than others, a common question asked by genetic researchers is 'which program is best for me?'. To help researchers answer this question, the following software review aims to summarize the main advantages and disadvantages of the popular GENEHUNTER package.

Computational Techniques for Haplotype Inference and for Local Alignment Significance

This thesis which consists of an introduction and four peer-reviewed original publications studies the problems of haplotype inference (haplotyping) and local alignment significance. The problems studied here belong to the broad area of bioinformatics and computational biology. The presented solutions are computationally fast and accurate, which makes them practical in high-throughput sequence data analysis. Haplotype inference is a computational problem where the goal is to estimate haplotypes from a sample of genotypes as accurately as possible. This problem is important as the direct measurement of haplotypes is difficult, whereas the genotypes are easier to quantify. Haplotypes are the key-players when studying for example the genetic causes of diseases. In this thesis, three methods are presented for the haplotype inference problem referred to as HaploParser, HIT, and BACH. HaploParser is based on a combinatorial mosaic model and hierarchical parsing that together mimic recombinations and point-mutations in a biologically plausible way. In this mosaic model, the current population is assumed to be evolved from a small founder population. Thus, the haplotypes of the current population are recombinations of the (implicit) founder haplotypes with some point--mutations. HIT (Haplotype Inference Technique) uses a hidden Markov model for haplotypes and efficient algorithms are presented to learn this model from genotype data. The model structure of HIT is analogous to the mosaic model of HaploParser with founder haplotypes. Therefore, it can be seen as a probabilistic model of recombinations and point-mutations. BACH (Bayesian Context-based Haplotyping) utilizes a context tree weighting algorithm to efficiently sum over all variable-length Markov chains to evaluate the posterior probability of a haplotype configuration. Algorithms are presented that find haplotype configurations with high posterior probability. BACH is the most accurate method presented in this thesis and has comparable performance to the best available software for haplotype inference. Local alignment significance is a computational problem where one is interested in whether the local similarities in two sequences are due to the fact that the sequences are related or just by chance. Similarity of sequences is measured by their best local alignment score and from that, a p-value is computed. This p-value is the probability of picking two sequences from the null model that have as good or better best local alignment score. Local alignment significance is used routinely for example in homology searches. In this thesis, a general framework is sketched that allows one to compute a tight upper bound for the p-value of a local pairwise alignment score. Unlike the previous methods, the presented framework is not affeced by so-called edge-effects and can handle gaps (deletions and insertions) without troublesome sampling and curve fitting.

Mathematical model and rule extraction for tool wear monitoring problem using nature inspired techniques

In this paper, pattern classification problem in tool wear monitoring is solved using nature inspired techniques such as Genetic Programming(GP) and Ant-Miner (AM). The main advantage of GP and AM is their ability to learn the underlying data relationships and express them in the form of mathematical equation or simple rules. The extraction of knowledge from the training data set using GP and AM are in the form of Genetic Programming Classifier Expression (GPCE) and rules respectively. The GPCE and AM extracted rules are then applied to set of data in the testing/validation set to obtain the classification accuracy. A major attraction in GP evolved GPCE and AM based classification is the possibility of obtaining an expert system like rules that can be directly applied subsequently by the user in his/her application. The performance of the data classification using GP and AM is as good as the classification accuracy obtained in the earlier study.

Nature inspired optimization techniques for the design optimization of laminated composite structures using failure criteria

The design optimization of laminated composites using naturally inspired optimization techniques such as vector evaluated particle swarm optimization (VEPSO) and genetic algorithms (GA) are used in this paper. The design optimization of minimum weight of the laminated composite is evaluated using different failure criteria. The failure criteria considered are maximum stress (MS), Tsai-Wu (TW) and failure mechanism based (FMB) failure criteria. Minimum weight of the laminates are obtained for different failure criteria using VEPSO and GA for different combinations of loading. From the study it is evident that VEPSO and GA predict almost the same minimum weight of the laminate for the given loading. Comparison of minimum weight of the laminates by different failure criteria differ for some loading combinations. The comparison shows that FMBFC provide better results for all combinations of loading. (C) 2010 Elsevier Ltd. All rights reserved.

Genetic algorithms: a survey

Genetic algorithms provide an alternative to traditional optimization techniques by using directed random searches to locate optimal solutions in complex landscapes. We introduce the art and science of genetic algorithms and survey current issues in GA theory and practice. We do not present a detailed study, instead, we offer a quick guide into the labyrinth of GA research. First, we draw the analogy between genetic algorithms and the search processes in nature. Then we describe the genetic algorithm that Holland introduced in 1975 and the workings of GAs. After a survey of techniques proposed as improvements to Holland's GA and of some radically different approaches, we survey the advances in GA theory related to modeling, dynamics, and deception

On generating optimal signal probabilities for random tests: A genetic approach

Genetic Algorithms are robust search and optimization techniques. A Genetic Algorithm based approach for determining the optimal input distributions for generating random test vectors is proposed in the paper. A cost function based on the COP testability measure for determining the efficacy of the input distributions is discussed, A brief overview of Genetic Algorithms (GAs) and the specific details of our implementation are described. Experimental results based on ISCAS-85 benchmark circuits are presented. The performance pf our GA-based approach is compared with previous results. While the GA generates more efficient input distributions than the previous methods which are based on gradient descent search, the overheads of the GA in computing the input distributions are larger. To account for the relatively quick convergence of the gradient descent methods, we analyze the landscape of the COP-based cost function. We prove that the cost function is unimodal in the search space. This feature makes the cost function amenable to optimization by gradient-descent techniques as compared to random search methods such as Genetic Algorithms.

Automatic decomposition of unstructured meshes employing genetic algorithms for parallel FEM computations

Parallel execution of computational mechanics codes requires efficient mesh-partitioning techniques. These mesh-partitioning techniques divide the mesh into specified number of submeshes of approximately the same size and at the same time, minimise the interface nodes of the submeshes. This paper describes a new mesh partitioning technique, employing Genetic Algorithms. The proposed algorithm operates on the deduced graph (dual or nodal graph) of the given finite element mesh rather than directly on the mesh itself. The algorithm works by first constructing a coarse graph approximation using an automatic graph coarsening method. The coarse graph is partitioned and the results are interpolated onto the original graph to initialise an optimisation of the graph partition problem. In practice, hierarchy of (usually more than two) graphs are used to obtain the final graph partition. The proposed partitioning algorithm is applied to graphs derived from unstructured finite element meshes describing practical engineering problems and also several example graphs related to finite element meshes given in the literature. The test results indicate that the proposed GA based graph partitioning algorithm generates high quality partitions and are superior to spectral and multilevel graph partitioning algorithms.

Pickup and delivery problem using metaheuristics techniques

Dial-a-ride problem (DARP) is an optimization problem which deals with the minimization of the cost of the provided service where the customers are provided a door-to-door service based on their requests. This optimization model presented in earlier studies, is considered in this study. Due to the non-linear nature of the objective function the traditional optimization methods are plagued with the problem of converging to a local minima. To overcome this pitfall we use metaheuristics namely Simulated Annealing (SA), Particle Swarm Optimization (PSO), Genetic Algorithm (GA) and Artificial Immune System (AIS). From the results obtained, we conclude that Artificial Immune System method effectively tackles this optimization problem by providing us with optimal solutions. Crown Copyright (C) 2011 Published by Elsevier Ltd. All rights reserved.

Colored polydimethylsiloxane micropillar arrays for high throughput measurements of forces applied by genetic model organisms

Measuring forces applied by multi-cellular organisms is valuable in investigating biomechanics of their locomotion. Several technologies have been developed to measure such forces, for example, strain gauges, micro-machined sensors, and calibrated cantilevers. We introduce an innovative combination of techniques as a high throughput screening tool to assess forces applied by multiple genetic model organisms. First, we fabricated colored Polydimethylsiloxane (PDMS) micropillars where the color enhances contrast making it easier to detect and track pillar displacement driven by the organism. Second, we developed a semiautomated graphical user interface to analyze the images for pillar displacement, thus reducing the analysis time for each animal to minutes. The addition of color reduced the Young's modulus of PDMS. Therefore, the dye-PDMS composite was characterized using Yeoh's hyperelastic model and the pillars were calibrated using a silicon based force sensor. We used our device to measure forces exerted by wild type and mutant Caenorhabditis elegans moving on an agarose surface. Wild type C. elegans exert an average force of similar to 1 mu N on an individual pillar and a total average force of similar to 7.68 mu N. We show that the middle of C. elegans exerts more force than its extremities. We find that C. elegans mutants with defective body wall muscles apply significantly lower force on individual pillars, while mutants defective in sensing externally applied mechanical forces still apply the same average force per pillar compared to wild type animals. Average forces applied per pillar are independent of the length, diameter, or cuticle stiffness of the animal. We also used the device to measure, for the first time, forces applied by Drosophila melanogaster larvae. Peristaltic waves occurred at 0.4Hz applying an average force of similar to 1.58 mu N on a single pillar. Our colored microfluidic device along with its displacement tracking software allows us to measure forces applied by multiple model organisms that crawl or slither to travel through their environment. (C) 2015 AIP Publishing LLC.

Evaluation of manufacturing techniques for a minifluidics demonstrator system

A multi-disciplinary team based at Heriot-Watt University and other Universities has been set up to tackle the design and manufacturing of lab-on-a-chip for industries as one of the demonstrators of the EPSRC Grand Challenge project "3D-Mintegration". The team focuses on the analysis of foetal genetic material extracted from maternal blood as a smart alternative to invasive prenatal testing such as amniocentesis. The first module of the microsystem envisaged achieves a separation of blood cells from plasma. This system permits the testing of different manufacturing techniques.

Dynamics of pneumococcal nasopharyngeal carriage in healthy children attending a day care center in northern Spain. Influence of detection techniques on the results

8 p.

A genetic and biochemical analysis of pre-mRNA splicing in Saccharomyces cerevisiae

Pre-mRNA splicing requires interaction of cis- acting intron sequences with trans -acting factors: proteins and small nuclear ribonucleoproteins (snRNPs). The assembly of these factors into a large complex, the spliceosome, is essential for the subsequent two step splicing reaction. First, the 5' splice site is cleaved and free exon 1 and a lariat intermediate (intron- exon2) form. In the second reaction the 3' splice site is cleaved the exons ligated and lariat intron released. A combination of genetic and biochemical techniques have been used here to study pre-mRNA splicing in yeast.

Yeast introns have three highly conserved elements. We made point mutations within these elements and found that most of them affect splicing efficiency in vivo and in vitro, usually by inhibiting spliceosome assembly.

To study trans -acting splicing factors we generated and screened a bank of temperature- sensitive (ts) mutants. Eleven new complementation groups (prp17 to prp27) were isolated. The four phenotypic classes obtained affect different steps in splicing and accumulate either: 1) pre-mRNA, 2) lariat intermediate, 3) excised intron or 4) both pre-mRNA and intron. The latter three classes represent novel phenotypes. The excised intron observed in one mutant: prp26 is stabilized due to protection in a snRNP containing particle. Extracts from another mutant: prpl8 are heat labile and accumulate lariat intermediate and exon 1. This is especially interesting as it allows analysis of the second splicing reaction. In vitro complementation of inactivated prp18 extracts does not require intact snRNPs. These studies have also shown the mutation to be in a previously unknown splicing protein. A specific requirement for A TP is also observed for the second step of splicing. The PRP 18 gene has been cloned and its polyadenylated transcript identified.

The impact of molecular biology on assessment of water quality: advantages and limitations of current techniques

The advent of molecular biology has had a dramatic impact on all aspects of biology, not least applied microbial ecology. Microbiological testing of water has traditionally depended largely on culture techniques. Growing understanding that only a small proportion of microbial species are culturable, and that many microorganisms may attain a viable but non-culturable state, has promoted the development of novel approaches to monitoring pathogens in the environment. This has been paralleled by an increased awareness of the surprising genetic diversity of natural microbial populations. By targeting gene sequences that are specific for particular microorganisms, for example genes that encode diagnostic enzymes, or species-specific domains of conserved genes such as 16S ribosomal RNA coding sequences (rrn genes), the problems of culture can be avoided. Technical developments, notably in the area of in vitro amplification of DNA using the polymerase chain reaction (PCR), now permit routine detection and identification of specific microorganisms, even when present in very low numbers. Although the techniques of molecular biology have provided some very powerful tools for environmental microbiology, it should not be forgotten that these have their own drawbacks and biases in sampling. For example, molecular techniques are dependent on efficient lysis and recovery of nucleic acids from both vegetative forms and spores of microbial species that may differ radically when growing in the laboratory compared with the natural environment. Furthermore, PCR amplification can introduce its own bias depending on the nature of the oligonucleotide primers utilised. However, despite these potential caveats, it seems likely that a molecular biological approach, particularly with its potential for automation, will provide the mainstay of diagnostic technology for the foreseeable future.

Muitiobjective pressurized water reactor reload core design by nondominated genetic algorithm search

The design of pressurized water reactor reload cores is not only a formidable optimization problem but also, in many instances, a multiobjective problem. A genetic algorithm (GA) designed to perform true multiobjective optimization on such problems is described. Genetic algorithms simulate natural evolution. They differ from most optimization techniques by searching from one group of solutions to another, rather than from one solution to another. New solutions are generated by breeding from existing solutions. By selecting better (in a multiobjective sense) solutions as parents more often, the population can be evolved to reveal the trade-off surface between the competing objectives. An example illustrating the effectiveness of this novel method is presented and analyzed. It is found that in solving a reload design problem the algorithm evaluates a similar number of loading patterns to other state-of-the-art methods, but in the process reveals much more information about the nature of the problem being solved. The actual computational cost incurred depends: on the core simulator used; the GA itself is code independent.

Study of inter species diversity and population structure by molecular genetic method in Iranian Artemia

Artemia is a small crustacean that adapted to live in brine water and has been seen in different brine water sources in Iran. Considering the importance of genetic studies manifest inter population differences in species, to estimate genetic structure, detect difference at molecular level and separate different Artemia populations of Iran, also study of phylogenic relationships among them, samples of Artemia were collected from nine region: Urmia lake in West Azerbaijan, Shoor and Inche-Borun lakes in Golestan, Hoze-Soltan and Namak lakes in Qom, Maharloo and Bakhteghan lakes in Fars, Nough pool in Kerman and Mighan pool in Markazi and DNA extracted by phenol-chloroform method. Primers designed on a ribosomal fragment (16s rRNA) of mt DNA sequence and PCR was done. Digestion of the 1566 bp segment PCR product by 10 restriction endonuclease (Alu I, EcoR I, Eco47 I, Hae III, Hind III, Hinf I, Mbo I, Msp I, Rsa I, TaqI) showed 25 different haplotypes: 9 in Urmia, 4 in Shoor and Inche- Borun, 1 in Namak and Hoze-Soltan, 3 in Mighan, 1 in Bakhtegan Maharlo, 3 in Maharloo and 4 in Nough. Measurement of haplotype and nucleotide diversity intra population and nucleotide diversity and divergence inter populations and evolutionary distance between haplotypes showed a high diversity in mitochondrial genome of Artemia in studied regions whose results are similar to those explained for highly geographic expansion organism. In addition, results showed considerable heterogeneity between different populations and there are enough evidences in haplotypic level for separation of studied samples and division of Iranian Artemia to seven populations including Urmia, Shoor and Inche-Borun, Hoze-Soltan and Namak, Maharloo, Bakhteghan, Nough and Mighan. Phylogenetic analysis of the 16S rRNA data set resulted strict consensus and neighbor joining distance trees, demonstrated that all samples were monophyletic and parthenogenetic form derivation from bisexual populations and genetically high resemblance to those of A. urmiana. Study of 270 specimens from different region showed the genus Artemia in Iran clustered into three clades including: 1- Shoor, Inche-Burun, Hoze-Soltan, Namak, Bakhtegan and Maharloo 2- Nough and Mighan 3- Urmia. Totally, obtained results indicated to ability of used techniques for study of inter species diversity, population structure, reveal of phylogenic relationship and dividing of different populations of Artemia in Iran.