A Family of Tree-Based Generators for Bubbles in Directed Graphs

DOI10.1007/978-3-030-48966-3_2OpenAlexW3031500417MaRDI QIDQ5041176

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

Publication date: 13 October 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-48966-3_2

zbMATH Keywords

directed graphsalternative splicingbubble generator

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (1)

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

Uses Software

• STAR

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
• On bubble generators in directed graphs

This page was built for publication: A Family of Tree-Based Generators for Bubbles in Directed Graphs