A family of tree-based generators for bubbles in directed graphs

DOI10.7155/jgaa.00572zbMath1489.05133OpenAlexW3209435224MaRDI QIDQ5084695

Luca Pepè Sciarria, Marie-France Sagot, Giuseppe F. Italiano, Blerina Sinaimeri, Leandro Ishi Soares de Lima, Vicente Acuña

Publication date: 28 June 2022

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00572

zbMATH Keywords

directed graphsalternative splicingbubble generator

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cycle bases in graphs characterization, algorithms, complexity, and applications
• Linear-time superbubble identification algorithm for genome assembly
• A note on fundamental, non-fundamental, and robust cycle bases
• Robust cycle bases do not exist for \(K_{n, n}\) if \(n \geq 8\)
• Algorithms to compute minimum cycle basis in directed graphs
• Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for k-Vertex Connectivity
• Circuit bases of strongly connected digraphs
• A Family of Tree-Based Generators for Bubbles in Directed Graphs
• On bubble generators in directed graphs

This page was built for publication: A family of tree-based generators for bubbles in directed graphs