Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the recognition of de Bruijn graphs and their induced subgraphs

From MaRDI portal
Publication:1348115
Jump to:navigation, search

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


zbMATH Keywords

induced subgraphsrecognitiondirected de Bruijn graphs


Mathematics Subject Classification ID

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1348115&oldid=13484297"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 13:58.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki