Results 101 to 110 of about 3,685 (173)

Gra-CRC-miRTar: The pre-trained nucleotide-to-graph neural networks to identify potential miRNA targets in colorectal cancer

Computational and Structural Biotechnology Journal
Colorectal cancer (CRC) is the third most diagnosed cancer and the second deadliest cancer worldwide representing a major public health problem. In recent years, increasing evidence has shown that microRNA (miRNA) can control the expression of targeted ...
Rui Yin, Hongru Zhao, Lu Li, Qiang Yang, Min Zeng, Carl Yang, Jiang Bian, Mingyi Xie   +7 more
doaj   +1 more source

A Study of Computational Genome Assembly by Graph Theory

Annals of the West University of Timisoara: Mathematics and Computer Science
The assembly of billions of short sequencing reads into a contiguous genome is a daunting task. The foundation knowledge of current DNA assembly models is concentrated among a select group, where the solution to the genome assembly challenge lies in ...
Sarkar Bijan
doaj   +1 more source

Feature extraction methods for metagenome de Bruijn graphs collections based on samples classification information

Научно-технический вестник информационных технологий, механики и оптики
The paper considers the comparative analysis of metagenomic samples collections using de Bruijn graphs. We propose methods for automatic feature extraction based on the results of comparative sample analysis, expert metadata, and statistical tests to ...
A. B. Ivanov, A. A. Shalyto, V. I. Ulyantsev   +2 more
doaj   +1 more source

A Novel Discrete Time Series Representation With De Bruijn Graphs for Enhanced Forecasting Using TimesNet

IEEE Access
In this paper, we present a novel method for advancing time series forecasting by representing discretized time series data through de Bruijn Graphs (dBGs).
Mert Onur Cakiroglu, Hasan Kurban, Elham Buxton, Mehmet Dalkilic   +3 more
doaj   +1 more source

Graphite: painting genomes using a colored De Bruijn graph

, 2023
Beeloo R, Zomer AL, Dutilh BE.
europepmc   +1 more source

Bijections in de Bruijn Graphs

, 2017
A T-net of order $m$ is a graph with $m$ nodes and $2m$ directed edges, where every node has indegree and outdegree equal to $2$. (A well known example of T-nets are de Bruijn graphs.) Given a T-net $N$ of order $m$, there is the so called "doubling" process that creates a T-net $N^*$ from $N$ with $2m$ nodes and $4m$ edges. Let $|X|$ denote the number
openaire   +2 more sources

De-Bruijn graph partitioning for scalable and accurate DNA storage processing. [PDF]

Bioinformatics
De Moor F, Boullé O, Lavenier D.
europepmc   +1 more source

deMEM: a novel divide-and-conquer framework based on de Bruijn graph for scalable multiple sequence alignment. [PDF]

Gigascience
Wei Y, Huang Z, Zhang P, Wang Y, Li Y, Yu L, Zou Q.   +6 more
europepmc   +1 more source

deSALT: fast and accurate long transcriptomic read alignment with de Bruijn graph-based index. [PDF]

Genome Biol, 2019
Liu B, Liu Y, Li J, Guo H, Zang T, Wang Y.   +5 more
europepmc   +1 more source

Graphite: painting genomes using a colored de Bruijn graph. [PDF]

NAR Genom Bioinform
Beeloo R, Zomer AL, Deorowicz S, Dutilh BE.   +3 more
europepmc   +1 more source