Search bioRxiv⌕ Search

Biology subjects

Caldonazzo Garbelini, J. M.

Publications and source records attributed to Caldonazzo Garbelini, J. M..

2 recordsLinked to original sources

biomapp::chip: Large-Scale Motif Analysis

BackgroundDiscovery biological motifs plays a fundamental role in understanding regulatory mechanisms. Computationally, they can be efficiently represented as kmers, making the counting of these elEMents a critical aspect for ensuring not only the accuracy but also the efficiency of the analytical process. This is particularly useful in scenarios involving large data volumes, such as those generated by the ChIP-seq protocol. Against this backdrop, we introduce O_SCPLOWBIOMAPPC_SCPLOWO_SCPCAP ::C_SCPCAPO_SCPLOWCHIPC_SCPLOW, a tool specifically designed to optimize the discovery of biological motifs in large data volumes. ResultsWe conducted a comprehensive set of comparative tests with state-of-the-art algorithms. Our analyses revealed that O_SCPLOWBIOMAPPC_SCPLOWO_SCPCAP ::C_SCPCAPO_SCPLOWCHIPC_SCPLOW outperforms existing approaches in various metrics, excelling both in terms of performance and accuracy. The tests demonstrated a higher detection rate of significant motifs and also greater agility in the execution of the algorithm. Furthermore, the O_SCPLOWSMTC_SCPLOW component played a vital role in the systems efficiency, proving to be both agile and accurate in kmer counting, which in turn improved the overall efficacy of our tool. ConclusionO_SCPLOWBIOMAPPC_SCPLOWO_SCPCAP ::C_SCPCAPO_SCPLOWCHIPC_SCPLOW represent real advancements in the discovery of biological motifs, particularly in large data volume scenarios, offering a relevant alternative for the analysis of ChIP-seq data and have the potential to boost future research in the field. This software can be found at the following address: https://github.com/jadermcg/BIOMAPP-CHIP.

bioinformatics↗

Discovering motifs and genomic patterns with SMT: a high-performance data structure for counting kmers

MotivationThe search for conserved motifs in DNA sequences is an important problem in bioinformatics. The growing availability of large-scale genomic data poses significant challenges for computational biology, particularly in terms of efficiency in analysis, kmer identification, and noise presence. The detection of conserved motifs and patterns in DNA sequences is crucial for understanding gene functions and regulations. Therefore, it is essential to develop a data structure that can handle these large volumes of information and provide accurate and fast results. ResultsWe present SMT, an innovative tool designed to efficiently store and count kmers, optimizing memory usage and computation time. The application of SMT has also proven effective in discovering motifs in noisy datasets, allowing the identification of conserved regions in sequences. Furthermore, SMT enables exact searches in constant time and recovers the most abundant k-mers, as well as performs approximate searches in linear time to find fragments with up to d mutations. This approach facilitates large-scale data analysis and provides important insights into the conserved properties of biological sequences. The application of SMT in motif discovery demonstrates its potential to drive research in bioinformatics and genomics. Supplementary data and results are available to provide additional information and support the conclusions presented in this work. Availability and implementationThe source code of the presented method is publicly available at https://github.com/jadermcg/SMT.

bioinformatics↗