Characterizations for some types of DNA graphs

DOI10.1007/s10910-006-9099-4zbMath1119.92074OpenAlexW1971486241MaRDI QIDQ2385373

Xianyue Li, Heping Zhang

Publication date: 12 October 2007

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10910-006-9099-4

zbMATH Keywords

de Bruijn graphDNA graph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Biochemistry, molecular biology (92C40) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

On the readability of overlap digraphs ⋮ On the Readability of Overlap Digraphs ⋮ Graph algorithms for DNA sequencing -- origins, current models and the future ⋮ Classification of de Bruijn-based labeled digraphs ⋮ Bipartite graphs of small readability

Cites Work

• The line digraph of a regular and pancircular digraph is also regular and pancircular
• On the recognition of de Bruijn graphs and their induced subgraphs
• Recognizing DNA graphs is difficult.
• On some properties of DNA graphs
• The adjoints of DNA graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Characterizations for some types of DNA graphs