BioSeqZip: a collapser of NGS redundant reads for the optimization of sequence analysis

Bioinformatics tools for the sequence complexity estimates

We review current methods and bioinformatics tools for the text complexity estimates (information and entropy measures). The search DNA regions with extreme statistical characteristics such as low complexity regions are important for biophysical models of chromosome function and gene transcription regulation in genome scale. We discuss the complexity profiling for segmentation and delineation of genome sequences, search for genome repeats and transposable elements, and applications to next-generation sequencing reads. We review the complexity methods and new applications fields: analysis of mutation hotspots loci, analysis of short sequencing reads with quality control, and alignment-free genome comparisons. The algorithms implementing various numerical measures of text complexity estimates including combinatorial and linguistic measures have been developed before genome sequencing era. The series of tools to estimate sequence complexity use compression approaches, mainly by modification of Lempel-Ziv compression. Most of the tools are available online providing large-scale service for whole genome analysis. Novel machine learning applications for classification of complete genome sequences also include sequence compression and complexity algorithms. We present comparison of the complexity methods on the different sequence sets, the applications for gene transcription regulatory regions analysis. Furthermore, we discuss approaches and application of sequence complexity for proteins. The complexity measures for amino acid sequences could be calculated by the same entropy and compression-based algorithms. But the functional and evolutionary roles of low complexity regions in protein have specific features differing from DNA. The tools for protein sequence complexity aimed for protein structural constraints. It was shown that low complexity regions in protein sequences are conservative in evolution and have important biological and structural functions. Finally, we summarize recent findings in large scale genome complexity comparison and applications for coronavirus genome analysis.

LaRA 2: parallel and vectorized program for sequence-structure alignment of RNA sequences

BACKGROUND

The function of non-coding RNA sequences is largely determined by their spatial conformation, namely the secondary structure of the molecule, formed by Watson-Crick interactions between nucleotides. Hence, modern RNA alignment algorithms routinely take structural information into account. In order to discover yet unknown RNA families and infer their possible functions, the structural alignment of RNAs is an essential task. This task demands a lot of computational resources, especially for aligning many long sequences, and it therefore requires efficient algorithms that utilize modern hardware when available. A subset of the secondary structures contains overlapping interactions (called pseudoknots), which add additional complexity to the problem and are often ignored in available software.

RESULTS

We present the SeqAn-based software LaRA 2 that is significantly faster than comparable software for accurate pairwise and multiple alignments of structured RNA sequences. In contrast to other programs our approach can handle arbitrary pseudoknots. As an improved re-implementation of the LaRA tool for structural alignments, LaRA 2 uses multi-threading and vectorization for parallel execution and a new heuristic for computing a lower boundary of the solution. Our algorithmic improvements yield a program that is up to 130 times faster than the previous version.

CONCLUSIONS

With LaRA 2 we provide a tool to analyse large sets of RNA secondary structures in relatively short time, based on structural alignment. The produced alignments can be used to derive structural motifs for the search in genomic databases.

Minirmd: accurate and fast duplicate removal tool for short reads via multiple minimizers

SUMMARY

Removing duplicate and near-duplicate reads, generated by high-throughput sequencing technologies, is able to reduce computational resources in downstream applications. Here we develop minirmd, a de novo tool to remove duplicate reads via multiple rounds of clustering using different length of minimizer. Experiments demonstrate that minirmd removes more near-duplicate reads than existing clustering approaches and is faster than existing multi-core tools. To the best of our knowledge, minirmd is the first tool to remove near-duplicates on reverse-complementary strand.

AVAILABILITY AND IMPLEMENTATION

https://github.com/yuansliu/minirmd.

SUPPLEMENTARY INFORMATION

Supplementary data are available at Bioinformatics online.

Cooperative Sequence Clustering and Decoding for DNA Storage System with Fountain Codes

MOTIVATION

In DNA storage systems, there are tradeoffs between writing and reading costs. Increasing the code rate of error-correcting codes may save writing cost, but it will need more sequence reads for data retrieval. There is potentially a way to improve sequencing and decoding processes in such a way that the reading cost induced by this tradeoff is reduced without increasing the writing cost. In past researches, clustering, alignment, and decoding processes were considered as separate stages but we believe that using the information from all these processes together may improve decoding performance. Actual experiments of DNA synthesis and sequencing should be performed because simulations cannot be relied on to cover all error possibilities in practical circumstances.

RESULTS

For DNA storage systems using fountain code and Reed-Solomon (RS) code, we introduce several techniques to improve the decoding performance. We designed the decoding process focusing on the cooperation of key components: Hamming-distance based clustering, discarding of abnormal sequence reads, RS error correction as well as detection, and quality score-based ordering of sequences. We synthesized 513.6KB data into DNA oligo pools and sequenced this data successfully with Illumina MiSeq instrument. Compared to Erlich's research, the proposed decoding method additionally incorporates sequence reads with minor errors which had been discarded before, and thuswas able to make use of 10.6-11.9% more sequence reads from the same sequencing environment, this resulted in 6.5-8.9% reduction in the reading cost. Channel characteristics including sequence coverage and read-length distributions are provided as well.

AVAILABILITY

The raw data files and the source codes of our experiments are available at: https://github.com/jhjeong0702/dna-storage.

Immunological pathways of macrophage response to Brucella ovis infection

As the molecular mechanisms of Brucella ovis pathogenicity are not completely clear, we have applied a transcriptome approach to identify the differentially expressed genes (DEGs) in RAW264.7 macrophage infected with B. ovis. The DEGs related to immune pathway were identified by Kyoto Encyclopedia of Genes and Genomes (KEGG) and Gene Ontology (GO) functional enrichment analysis. Quantitative real-time PCR (qRT-PCR) was performed to validate the transcriptome sequencing data. In total, we identified 337 up-regulated and 264 down-regulated DEGs in B. ovis-infected group versus mock group. Top 20 pathways were enriched by KEGG analysis and 20 GO by functional enrichment analysis in DEGs involved in the molecular function, cellular component, and biological process and so on, which revealed multiple immunological pathways in RAW264.7 macrophage cells in response to B. ovis infection, including inflammatory response, immune system process, immune response, cytokine activity, chemotaxis, chemokine-mediated signaling pathway, chemokine activity, and CCR chemokine receptor binding. qRT-PCR results showed Ccl2 (ENSMUST00000000193), Ccl2 (ENSMUST00000124479), Ccl3 (ENSMUST00000001008), Hmox1 (ENSMUST00000005548), Hmox1 (ENSMUST00000159631), Cxcl2 (ENSMUST00000075433), Cxcl2 (ENSMUST00000200681), Cxcl2 (ENSMUST00000200919), and Cxcl2 (ENSMUST00000202317). Our findings firstly elucidate the pathways involved in B. ovis-induced host immune response, which may lay the foundation for revealing the bacteria–host interaction and demonstrating the pathogenic mechanism of B. ovis.