On the recognition of de Bruijn graphs and their induced subgraphs
From MaRDI portal
Publication:1348115
DOI10.1016/S0012-365X(01)00133-9zbMath0996.05061DBLPjournals/dm/BlazewiczFKK02OpenAlexW1988719430WikidataQ57387815 ScholiaQ57387815MaRDI QIDQ1348115
Marta Kasprzak, Piotr Formanowicz, Daniel Kobler, Jacek Błażewicz
Publication date: 15 May 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00133-9
Graph theory (including graph drawing) in computer science (68R10) Protein sequences, DNA sequences (92D20) Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20)
Related Items (8)
On the readability of overlap digraphs ⋮ Characterizations for some types of DNA graphs ⋮ On the Readability of Overlap Digraphs ⋮ Graph algorithms for DNA sequencing -- origins, current models and the future ⋮ Classification of de Bruijn-based labeled digraphs ⋮ Complexity of DNA sequencing by hybridization. ⋮ Selected combinatorial problems of computational biology ⋮ Bipartite graphs of small readability
This page was built for publication: On the recognition of de Bruijn graphs and their induced subgraphs