Discovering patterns in Plasmodium falciparum genomic DNA

The complexity landscape of viral genomes

BACKGROUND

Viruses are among the shortest yet highly abundant species that harbor minimal instructions to infect cells, adapt, multiply, and exist. However, with the current substantial availability of viral genome sequences, the scientific repertory lacks a complexity landscape that automatically enlights viral genomes' organization, relation, and fundamental characteristics.

RESULTS

This work provides a comprehensive landscape of the viral genome's complexity (or quantity of information), identifying the most redundant and complex groups regarding their genome sequence while providing their distribution and characteristics at a large and local scale. Moreover, we identify and quantify inverted repeats abundance in viral genomes. For this purpose, we measure the sequence complexity of each available viral genome using data compression, demonstrating that adequate data compressors can efficiently quantify the complexity of viral genome sequences, including subsequences better represented by algorithmic sources (e.g., inverted repeats). Using a state-of-the-art genomic compressor on an extensive viral genomes database, we show that double-stranded DNA viruses are, on average, the most redundant viruses while single-stranded DNA viruses are the least. Contrarily, double-stranded RNA viruses show a lower redundancy relative to single-stranded RNA. Furthermore, we extend the ability of data compressors to quantify local complexity (or information content) in viral genomes using complexity profiles, unprecedently providing a direct complexity analysis of human herpesviruses. We also conceive a features-based classification methodology that can accurately distinguish viral genomes at different taxonomic levels without direct comparisons between sequences. This methodology combines data compression with simple measures such as GC-content percentage and sequence length, followed by machine learning classifiers.

CONCLUSIONS

This article presents methodologies and findings that are highly relevant for understanding the patterns of similarity and singularity between viral groups, opening new frontiers for studying viral genomes' organization while depicting the complexity trends and classification components of these genomes at different taxonomic levels. The whole study is supported by an extensive website (https://asilab.github.io/canvas/) for comprehending the viral genome characterization using dynamic and interactive approaches.

Beyond randomness: Evaluating measures of information entropy in binary series

The enormous amount of currently available data demands efforts to extract meaningful information. For this purpose, different measurements are applied, including Shannon's entropy, permutation entropy, and the Lempel-Ziv complexity. These methods have been used in many applications, such as pattern recognition, series classification, and several other areas (e.g., physical, financial, and biomedical). Data in these applications are often presented in binary series with temporal correlations. Herein, we compare the measures of information entropy in binary series conveying short- and long-range temporal correlations characterized by the Hurst exponent H. Combining numerical and analytical approaches, we scrutinize different methods that were not efficient in detecting temporal correlations. To surpass this limitation, we propose a measure called the binary permutation index (BPI). We will demonstrate that BPI efficiently discriminates patterns embedded in the series, offering advantages over previous methods. Subsequently, we collect stock market time series and rain precipitation data as well as perform in vivo electrophysiological recordings in the hippocampus of an experimental animal model of temporal lobe epilepsy, in which the BPI application in both public open source and experimental data is demonstrated. An index is proposed to evaluate information entropy, allowing the ability to discriminate randomness and extract meaningful information in binary time series.

Information theory applications for biological sequence analysis

Information theory (IT) addresses the analysis of communication systems and has been widely applied in molecular biology. In particular, alignment-free sequence analysis and comparison greatly benefited from concepts derived from IT, such as entropy and mutual information. This review covers several aspects of IT applications, ranging from genome global analysis and comparison, including block-entropy estimation and resolution-free metrics based on iterative maps, to local analysis, comprising the classification of motifs, prediction of transcription factor binding sites and sequence characterization based on linguistic complexity and entropic profiles. IT has also been applied to high-level correlations that combine DNA, RNA or protein features with sequence-independent properties, such as gene mapping and phenotype analysis, and has also provided models based on communication systems theory to describe information transmission channels at the cell level and also during evolutionary processes. While not exhaustive, this review attempts to categorize existing methods and to indicate their relation with broader transversal topics such as genomic signatures, data compression and complexity, time series analysis and phylogenetic classification, providing a resource for future developments in this promising area.

DNA sequences at a glance

Data summarization and triage is one of the current top challenges in visual analytics. The goal is to let users visually inspect large data sets and examine or request data with particular characteristics. The need for summarization and visual analytics is also felt when dealing with digital representations of DNA sequences. Genomic data sets are growing rapidly, making their analysis increasingly more difficult, and raising the need for new, scalable tools. For example, being able to look at very large DNA sequences while immediately identifying potentially interesting regions would provide the biologist with a flexible exploratory and analytical tool. In this paper we present a new concept, the "information profile", which provides a quantitative measure of the local complexity of a DNA sequence, independently of the direction of processing. The computation of the information profiles is computationally tractable: we show that it can be done in time proportional to the length of the sequence. We also describe a tool to compute the information profiles of a given DNA sequence, and use the genome of the fission yeast Schizosaccharomyces pombe strain 972 h(-) and five human chromosomes 22 for illustration. We show that information profiles are useful for detecting large-scale genomic regularities by visual inspection. Several discovery strategies are possible, including the standalone analysis of single sequences, the comparative analysis of sequences from individuals from the same species, and the comparative analysis of sequences from different organisms. The comparison scale can be varied, allowing the users to zoom-in on specific details, or obtain a broad overview of a long segment. Software applications have been made available for non-commercial use at http://bioinformatics.ua.pt/software/dna-at-glance.

A biological compression model and its applications

A biological compression model, expert model, is presented which is superior to existing compression algorithms in both compression performance and speed. The model is able to compress whole eukaryotic genomes. Most importantly, the model provides a framework for knowledge discovery from biological data. It can be used for repeat element discovery, sequence alignment and phylogenetic analysis. We demonstrate that the model can handle statistically biased sequences and distantly related sequences where conventional knowledge discovery tools often fail.

Complexity of VTA DA neural activities in response to PFC transection in nicotine treated rats

Background

The dopaminergic (DA) neurons in the ventral tegmental area (VTA) are widely implicated in the addiction and natural reward circuitry of the brain. These neurons project to several areas of the brain, including prefrontal cortex (PFC), nucleus accubens (NAc) and amygdala. The functional coupling between PFC and VTA has been demonstrated, but little is known about how PFC mediates nicotinic modulation in VTA DA neurons. The objectives of this study were to investigate the effect of acute nicotine exposure on the VTA DA neuronal firing and to understand how the disruption of communication from PFC affects the firing patterns of VTA DA neurons.

Methods

Extracellular single-unit recordings were performed on Sprague-Dawley rats and nicotine was administered after stable recording was established as baseline. In order to test how input from PFC affects the VTA DA neuronal firing, bilateral transections were made immediate caudal to PFC to mechanically delete the interaction between VTA and PFC.

Results

The complexity of the recorded neural firing was subsequently assessed using a method based on the Lempel-Ziv estimator. The results were compared with those obtained when computing the entropy of neural firing. Exposure to nicotine triggered a significant increase in VTA DA neurons firing complexity when communication between PFC and VTA was present, while transection obliterated the effect of nicotine. Similar results were obtained when entropy values were estimated.

Conclusions

Our findings suggest that PFC plays a vital role in mediating VTA activity. We speculate that increased firing complexity with acute nicotine administration in PFC intact subjects is due to the close functional coupling between PFC and VTA. This hypothesis is supported by the fact that deletion of PFC results in minor alterations of VTA DA neural firing when nicotine is acutely administered.

Nonlinear dynamical analysis of carbachol induced hippocampal oscillations in mice

AIM

Hippocampal neuronal network and synaptic impairment underlie learning and memory deficit in Alzheimer's disease (AD) patients and animal models. In this paper, we analyzed the dynamics and complexity of hippocampal neuronal network synchronization induced by acute exposure to carbachol, a nicotinic and muscarinic receptor co-agonist, using the nonlinear dynamical model based on the Lempel-Ziv estimator. We compared the dynamics of hippocampal oscillations between wild-type (WT) and triple-transgenic (3xTg) mice, as an AD animal model. We also compared these dynamic alterations between different age groups (5 and 10 months). We hypothesize that there is an impairment of complexity of CCh-induced hippocampal oscillations in 3xTg AD mice compared to WT mice, and that this impairment is age-dependent.

METHODS

To test this hypothesis, we used electrophysiological recordings (field potential) in hippocampal slices.

RESULTS

Acute exposure to 100 micromol/L CCh induced field potential oscillations in hippocampal CA1 region, which exhibited three distinct patterns: (1) continuous neural firing, (2) repeated burst neural firing and (3) the mixed (continuous and burst) pattern in both WT and 3xTg AD mice. Based on Lempel-Ziv estimator, pattern (2) was significantly lower than patterns (1) and (3) in 3xTg AD mice compared to WT mice (P<0.001), and also in 10-month old WT mice compared to those in 5-month old WT mice (P<0.01).

CONCLUSION

These results suggest that the burst pattern (theta oscillation) of hippocampal network is selectively impaired in 3xTg AD mouse model, which may reflect a learning and memory deficit in the AD patients.

Comparative analysis of long DNA sequences by per element information content using different contexts

BACKGROUND

Features of a DNA sequence can be found by compressing the sequence under a suitable model; good compression implies low information content. Good DNA compression models consider repetition, differences between repeats, and base distributions. From a linear DNA sequence, a compression model can produce a linear information sequence. Linear space complexity is important when exploring long DNA sequences of the order of millions of bases. Compressing a sequence in isolation will include information on self-repetition. Whereas compressing a sequence Y in the context of another X can find what new information X gives about Y. This paper presents a methodology for performing comparative analysis to find features exposed by such models.

RESULTS

We apply such a model to find features across chromosomes of Cyanidioschyzon merolae. We present a tool that provides useful linear transformations to investigate and save new sequences. Various examples illustrate the methodology, finding features for sequences alone and in different contexts. We also show how to highlight all sets of self-repetition features, in this case within Plasmodium falciparum chromosome 2.

CONCLUSION

The methodology finds features that are significant and that biologists confirm. The exploration of long information sequences in linear time and space is fast and the saved results are self documenting.

Interpretation of the Lempel-Ziv complexity measure in the context of biomedical signal analysis

Lempel-Ziv complexity (LZ) and derived LZ algorithms have been extensively used to solve information theoretic problems such as coding and lossless data compression. In recent years, LZ has been widely used in biomedical applications to estimate the complexity of discrete-time signals. Despite its popularity as a complexity measure for biosignal analysis, the question of LZ interpretability and its relationship to other signal parameters and to other metrics has not been previously addressed. We have carried out an investigation aimed at gaining a better understanding of the LZ complexity itself, especially regarding its interpretability as a biomedical signal analysis technique. Our results indicate that LZ is particularly useful as a scalar metric to estimate the bandwidth of random processes and the harmonic variability in quasi-periodic signals.

Nonlinear characteristics of blood oxygen saturation from nocturnal oximetry for obstructive sleep apnoea detection

Nocturnal oximetry is an attractive option for the diagnosis of obstructive sleep apnoea (OSA) syndrome because of its simplicity and low cost compared to polysomnography (PSG). The present study assesses nonlinear analysis of blood oxygen saturation (SaO(2)) from nocturnal oximetry as a diagnostic test to discriminate between OSA positive and OSA negative patients. A sample of 187 referred outpatients, clinically suspected of having OSA, was studied using nocturnal oximetry performed simultaneously with complete PSG. A positive OSA diagnosis was found for 111 cases, while the remaining 76 cases were classified as OSA negative. The following oximetric indices were obtained: cumulative time spent below a saturation of 90% (CT90), oxygen desaturation indices of 4% (ODI4), 3% (ODI3) and 2% (ODI2) and the delta index (Delta index). SaO(2) records were subsequently processed applying two nonlinear methods: central tendency measure (CTM) and Lempel-Ziv (LZ) complexity. Significant differences (p < 0.01) were found between OSA positive and OSA negative patients. Using CTM we obtained a sensitivity of 90.1% and a specificity of 82.9%, while with LZ the sensitivity was 86.5% and the specificity was 77.6%. CTM and LZ accuracies were higher than those provided by ODI4, ODI3, ODI2 and CT90. The results suggest that nonlinear analysis of SaO(2) signals from nocturnal oximetry could yield useful information in OSA diagnosis.

Complexity: an internet resource for analysis of DNA sequence complexity

The search for DNA regions with low complexity is one of the pivotal tasks of modern structural analysis of complete genomes. The low complexity may be preconditioned by strong inequality in nucleotide content (biased composition), by tandem or dispersed repeats or by palindrome-hairpin structures, as well as by a combination of all these factors. Several numerical measures of textual complexity, including combinatorial and linguistic ones, together with complexity estimation using a modified Lempel-Ziv algorithm, have been implemented in a software tool called 'Complexity' (http://wwwmgs.bionet.nsc.ru/mgs/programs/low_complexity/). The software enables a user to search for low-complexity regions in long sequences, e.g. complete bacterial genomes or eukaryotic chromosomes. In addition, it estimates the complexity of groups of aligned sequences.

Mapping of the Plasmodium falciparum multidrug resistance gene 5'-upstream region, and evidence of induction of transcript levels by antimalarial drugs in chloroquine sensitive parasites

The Plasmodium falciparum multidrug resistance gene, pfmdr1, has been shown to be involved in the mediation of the parasite's response to various antimalarial drugs. Previous studies of pfmdr1 expression have shown that transcript levels are increased in drug-resistant isolates. However, a detailed examination of the transcriptional regulation of this gene has not been completed. The aim of this study was to map the 5' UTR of pfmdr1, and to examine the transcriptional profile of the gene in sensitive parasites treated with four different antimalarial drugs. RT-PCR and 5'-RACE mapping showed that the 5' UTR has a length of 1.94 kb. A putative promoter has been identified via transient transfection. Northern analysis revealed a 2.1- to 2.7-fold increase in pfmdr1 expression in 3D7 parasites treated with 50 nM chloroquine for 6 h, confirming results from Serial Analysis of Gene Expression. 3D7 parasites were subsequently treated with experimentally derived IC50 concentrations of mefloquine, quinine and pyrimethamine. pfmdr1 transcript levels specifically increased 2.5-fold at 6 h in mefloquine-treated parasites and threefold in parasites treated with quinine for 30 min. There was no evidence of transcript induction in pyrimethamine-treated parasites. This is the first evidence of induction of pfmdr1 expression in sensitive cells; and suggests a novel method of transcriptional control for this gene.