Results 11 to 20 of about 595 (215)
Flowtigs: Safety in flow decompositions for assembly graphs
Summary: A decomposition of a network flow is a set of weighted walks whose superposition equals the flow. In this article, we give a simple and linear-time-verifiable complete characterization (flowtigs) of walks that are safe in such general flow ...
Francisco Sena +5 more
doaj +4 more sources
Assembly Graph Browser: interactive visualization of assembly graphs [PDF]
Abstract Summary Currently, most genome assembly projects focus on contigs and scaffolds rather than assembly graphs that provide a more comprehensive representation of an assembly. Since interactive visualization of large assembly graphs remains an open problem, we developed an Assembly Graph Browser
Alla Mikheenko, Mikhail Kolmogorov
openaire +2 more sources
The Number of Ways to Assemble a Graph [PDF]
Motivated by the question of how macromolecules assemble,the notion of an assembly tree of a graph is introduced. Given a graph $G$, the paper is concerned with enumerating the number of assembly trees of $G$, a problem that applies to the macromolecular assembly problem. Explicit formulas or generating functions are provided for the number of assembly
Andrew Vince, Miklós Bóna
openaire +6 more sources
Robust Self-assembly of Graphs [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stanislav Angelov +2 more
openaire +1 more source
Metagenomic binning with assembly graph embeddings [PDF]
Abstract Despite recent advancements in sequencing technologies and assembly methods, obtaining high-quality microbial genomes from metagenomic samples is still not a trivial task. Current metagenomic binners do not take full advantage of assembly graphs and are not optimized for long-read assemblies. Deep graph learning algorithms have
Andre Lamurias +4 more
openaire +3 more sources
STRONG: metagenomics strain resolution on assembly graphs [PDF]
Abstract We introduce STrain Resolution ON assembly Graphs (STRONG), which identifies strains de novo, from multiple metagenome samples. STRONG performs coassembly, and binning into metagenome assembled genomes (MAGs), and stores the coassembly graph prior to variant simplification.
Limasset, Antoine +9 more
openaire +6 more sources
Splicing graphs and EST assembly problem [PDF]
Abstract Motivation: The traditional approach to annotate alternative splicing is to investigate every splicing variant of the gene in a case-by-case fashion. This approach, while useful, has some serious shortcomings. Recent studies indicate that alternative splicing is more frequent than previously thought and some genes may produce ...
Steffen Heber +4 more
openaire +3 more sources
Planning Assembly Sequence with Graph Transformer
Submitted to ...
Lin Ma 0002 +6 more
openaire +4 more sources
Shotgun Assembly of Labeled Graphs
Ver3: 23 pages, matches published version but with a corrected proof of Theorem 4.5 (result unchanged); Ver2: 22 pages; Ver1: 21 ...
Elchanan Mossel, Nathan Ross
openaire +4 more sources
RResolver: efficient short-read repeat resolution within ABySS
Background De novo genome assembly is essential to modern genomics studies. As it is not biased by a reference, it is also a useful method for studying genomes with high variation, such as cancer genomes.
Vladimir Nikolić +7 more
doaj +1 more source

