Results 81 to 90 of about 2,351 (162)
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 +7 more
doaj +1 more source
Fast bootstrap and reliable readout using hidden references for DNA data storage
This study provides a bootstrap readout framework for DNA data storage based on multiple‐fold hidden references. We employ a multi‐stage alignment and error correction strategy, transforming the de novo readout into a resequencing‐like workflow. Correlation to the hidden watermark reference identifies low‐error‐rate reads, and bit‐wise consensus ...
Weigang Chen +6 more
wiley +1 more source
A Self-stabilizing General De Bruijn Graph [PDF]
Searching for other participants is one of the most important operations in a distributed system. We are interested in topologies in which it is possible to route a packet in a fixed number of hops until it arrives at its destination. Given a constant $d$, this paper introduces a new self-stabilizing protocol for the $q$-ary $d$-dimensional de Bruijn ...
Michael Feldmann 0001 +1 more
openaire +2 more sources
MGA: a tool for haplotype-mixed assembly of long and accurate reads
Recent large-scale genome sequencing projects have generated near-complete diploid assemblies that reconstruct both haplomes. Producing such assemblies remains formidable, typically requiring large teams, extensive manual curation, and integration of ...
Zhenmiao Zhang +3 more
doaj +1 more source
Abstract Water resources sustainability hinges upon an efficient and effective regulatory compliance and enforcement strategy that steers the collective actions of interdependent stakeholders. Achieving this goal is particularly challenging for groundwater due to its hidden nature, significant knowledge gaps about its state, its status as a common‐pool
Marcos Canales +4 more
wiley +1 more source
We study the problem of making a de Bruijn graph (dBG), constructed from a collection of strings, weakly connected while minimizing the total cost of edge additions. The input graph is a dBG that can be made weakly connected by adding edges (along with extra nodes if needed) from the underlying complete dBG.
Bernardini, Giulia +7 more
openaire +4 more sources
A new look at the de Bruijn graph
The author discusses various descriptions of the Good-de Bruijn graphs. In particular, he presents ``the ultimate depiction'' of these graphs, based on what he calls a cycle adjacency array.
openaire +1 more source
De Bruijn graph is one of the most important data structures used in de-novo genome assembly algorithms, especially for NGS data. There is a growing need for parallel data structures and algorithms due to the increasing number of cores in modern computers.
Daniel Górniak, Robert Nowak 0002
openaire +2 more sources
De Bruijn Graph Homomorphisms and Recursive De Bruijn Sequences
This paper presents a method to find new De Bruijn cycles based on ones of lesser order. This is done by mapping a De Bruijn cycle to several vertex disjoint cycles in a De Bruijn digraph of higher order and connecting these cycles into one full cycle.
Abbas Alhakim, Mufutau Akinwande
openaire +2 more sources
Compression Algorithm for Colored de Bruijn Graphs. [PDF]
Rahman A, Dufresne Y, Medvedev P.
europepmc +1 more source

