Superbubbles, ultrabubbles, and cacti

B Paten, JM Eizenga, YM Rosen, AM Novak… - Journal of …, 2018 - liebertpub.com
A superbubble is a type of directed acyclic subgraph with single distinct source and sink
vertices. In genome assembly and genetics, the possible paths through a superbubble can …

Superbubbles revisited

F Gärtner, L Müller, PF Stadler - Algorithms for Molecular Biology, 2018 - Springer
Background Superbubbles are distinctive subgraphs in direct graphs that play an important
role in assembly algorithms for high-throughput sequencing (HTS) data. Their practical …

[PDF][PDF] Obstruction for connected tree-width and connected path-width

T Fujita - Informatica, submitted - researchgate.net
A connected graph is one in which a path exists between any two vertices, ensuring that all
vertices are mutually accessible. Understanding how graph parameters behave under the …

[图书][B] Graph Methods for Computational Pangenomics

JM Eizenga - 2021 - search.proquest.com
In most sequencing experiments, sequencing reads are mapped to a reference genome
assembly in order to identify the genomic elements that the reads originated from. The …

[PDF][PDF] Comparative genomics in distant taxa

F Gärtner - Algorithms for Molecular Biology, 2013 - core.ac.uk
Comparative Genomics[3] in Distant Taxa Page 1 Comparative Genomics in Distant Taxa
Generating Total Orders of Digraphs Der Fakultät für Mathematik und Informatik der Universität …

[引用][C] Comparative Genomics in Distant Taxa: Generating Total Orders of Digraphs

F Gärtner - 2020 - Dissertation, Leipzig, Universität …