Blind equalization and sequence estimation using Markov chain Monte Carlo methods

This paper discusses the problem of restoring a digital input signal that has been degraded by an unknown FIR filter in noise, using the Gibbs sampler. A method for drawing a random sample of a sequence of bits is presented; this is shown to have faster convergence than a scheme by Chen and Li, which draws bits independently. ©1998 IEEE.

BarraCUDA – a Fast Sequence Mapping Software using Graphics Processing Units

High-throughput DNA sequencing (HTS) instruments today are capable of generating millions of sequencing reads in a short period of time, and this represents a serious challenge to current bioinformatics pipeline in processing such an enormous amount of data in a fast and economical fashion. Modern graphics cards are powerful processing units that consist of hundreds of scalar processors in parallel in order to handle the rendering of high-definition graphics in real-time. It is this computational capability that we propose to harness in order to accelerate some of the time-consuming steps in analyzing data generated by the HTS instruments. We have developed BarraCUDA, a novel sequence mapping software that utilizes the parallelism of NVIDIA CUDA graphics cards to map sequencing reads to a particular location on a reference genome. While delivering a similar mapping fidelity as other mainstream programs , BarraCUDA is a magnitude faster in mapping throughput compared to its CPU counterparts. The software is also capable of supporting multiple CUDA devices in parallel to further accelerate the mapping throughput. BarraCUDA is designed to take advantage of the parallelism of GPU to accelerate the mapping of millions of sequencing reads generated by HTS instruments. By doing this, we could, at least in part streamline the current bioinformatics pipeline such that the wider scientific community could benefit from the sequencing technology. BarraCUDA is currently available at http://seqbarracuda.sf.net

Image sequence segmentation using mixture-models with uniqueness and spatio-temporal consistency constraints

The use of mixture-model techniques for motion estimation and image sequence segmentation was discussed. The issues such as modeling of occlusion and uncovering, determining the relative depth of the objects in a scene, and estimating the number of objects in a scene were also investigated. The segmentation algorithm was found to be computationally demanding, but the computational requirements were reduced as the motion parameters and segmentation of the frame were initialized. The method provided a stable description, in whichthe addition and removal of objects from the description corresponded to the entry and exit of objects from the scene.

BarraCUDA - a fast short read sequence aligner using graphics processing units.

BACKGROUND: With the maturation of next-generation DNA sequencing (NGS) technologies, the throughput of DNA sequencing reads has soared to over 600 gigabases from a single instrument run. General purpose computing on graphics processing units (GPGPU), extracts the computing power from hundreds of parallel stream processors within graphics processing cores and provides a cost-effective and energy efficient alternative to traditional high-performance computing (HPC) clusters. In this article, we describe the implementation of BarraCUDA, a GPGPU sequence alignment software that is based on BWA, to accelerate the alignment of sequencing reads generated by these instruments to a reference DNA sequence. FINDINGS: Using the NVIDIA Compute Unified Device Architecture (CUDA) software development environment, we ported the most computational-intensive alignment component of BWA to GPU to take advantage of the massive parallelism. As a result, BarraCUDA offers a magnitude of performance boost in alignment throughput when compared to a CPU core while delivering the same level of alignment fidelity. The software is also capable of supporting multiple CUDA devices in parallel to further accelerate the alignment throughput. CONCLUSIONS: BarraCUDA is designed to take advantage of the parallelism of GPU to accelerate the alignment of millions of sequencing reads generated by NGS instruments. By doing this, we could, at least in part streamline the current bioinformatics pipeline such that the wider scientific community could benefit from the sequencing technology.BarraCUDA is currently available from http://seqbarracuda.sf.net.

Identification of Cj1051c as a Major determinant for the restriction barrier of Campylobacter jejuni StrainNCTC11168

Campylobacter jejuni is a leading cause of human diarrheal illness in the world, and research on it has benefitted greatly by the completion of several genome sequences and the development of molecular biology tools. However, many hurdles remain for a full understanding of this unique bacterial pathogen. One of the most commonly used strains for genetic work with C. jejuni is NCTC11168. While this strain is readily transformable with DNA for genomic recombination, transformation with plasmids is problematic. In this study, we have identified a determinant of this to be cj1051c, predicted to encode a restriction-modification type IIG enzyme. Knockout mutagenesis of this gene resulted in a strain with a 1,000-fold-enhanced transformation efficiency with a plasmid purified from a C. jejuni host. Additionally, this mutation conferred the ability to be transformed by plasmids isolated from an Escherichia coli host. Sequence analysis suggested a high level of variability of the specificity domain between strains and that this gene may be subject to phase variation. We provide evidence that cj1051c is active in NCTC11168 and behaves as expected for a type IIG enzyme. The identification of this determinant provides a greater understanding of the molecular biology of C. jejuni as well as a tool for plasmid work with strain NCTC11168. © 2012, American Society for Microbiology.

Identifying cancer subtypes in glioblastoma by combining genomic, transcriptomic and epigenomic data

We present a nonparametric Bayesian method for disease subtype discovery in multi-dimensional cancer data. Our method can simultaneously analyse a wide range of data types, allowing for both agreement and disagreement between their underlying clustering structure. It includes feature selection and infers the most likely number of disease subtypes, given the data. We apply the method to 277 glioblastoma samples from The Cancer Genome Atlas, for which there are gene expression, copy number variation, methylation and microRNA data. We identify 8 distinct consensus subtypes and study their prognostic value for death, new tumour events, progression and recurrence. The consensus subtypes are prognostic of tumour recurrence (log-rank p-value of $3.6 \times 10^{-4}$ after correction for multiple hypothesis tests). This is driven principally by the methylation data (log-rank p-value of $2.0 \times 10^{-3}$) but the effect is strengthened by the other 3 data types, demonstrating the value of integrating multiple data types. Of particular note is a subtype of 47 patients characterised by very low levels of methylation. This subtype has very low rates of tumour recurrence and no new events in 10 years of follow up. We also identify a small gene expression subtype of 6 patients that shows particularly poor survival outcomes. Additionally, we note a consensus subtype that showly a highly distinctive data signature and suggest that it is therefore a biologically distinct subtype of glioblastoma. The code is available from https://sites.google.com/site/multipledatafusion/

Modeling of SFR cores with Serpent-DYN3D codes sequence

DYN3D reactor dynamics nodal diffusion code was originally developed for the analysis of Light Water Reactors. In this paper, we demonstrate the feasibility of using DYN3D for modeling of fast spectrum reactors. A homogenized cross sections data library was generated using continuous energy Monte-Carlo code Serpent which provides significant modeling flexibility compared with traditional deterministic lattice transport codes and tolerable execution time. A representative sodium cooled fast reactor core was modeled with the Serpent-DYN3D code sequence and the results were compared with those produced by ERANOS code and with a 3D full core Monte-Carlo solution. Very good agreement between the codes was observed for the core integral parameters and power distribution suggesting that the DYN3D code with cross section library generated using Serpent can be reliably used for the analysis of fast reactors. © 2012 Elsevier Ltd. All rights reserved.