The adjoints of DNA graphs

DOI10.1007/S10910-004-1099-7zbMATH Open1083.92013OpenAlexW2041880906MaRDI QIDQ2485892FDOQ2485892

Authors: Jianxiu Hao 

Publication date: 5 August 2005

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

Full work available at URL: https://doi.org/10.1007/s10910-004-1099-7

Recommendations

• Finding Hamiltonian circuits in quasi-adjoint graphs
• Applications of graph theory in DNA sequencing by hybridization
• Euler circuits and DNA sequencing by hybridization
• Characterizations for some types of DNA graphs
• DNA paired fragment assembly using graph theory

zbMATH Keywords

recognitionadjoint

Mathematics Subject Classification ID

Applications of graph theory (05C90) Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• On some properties of DNA graphs
• Title not available (Why is that?)

Cited In (11)

• Finding Hamiltonian circuits in quasi-adjoint graphs
• Title not available (Why is that?)
• A fast algorithm for the construction of universal footprinting templates in DNA
• A comparison of graph-theoretic DNA hybridization models
• Graph algorithms for DNA sequencing -- origins, current models and the future
• Characterizations for some types of DNA graphs
• A DNA-based solution to the graph isomorphism problem using Adleman-Lipton model with stickers
• Classification of de Bruijn-based labeled digraphs
• DNA physical mapping and alternating Eulerian cycles in colored graphs
• DNA labelled graphs with DNA computing
• Four-regular graphs with rigid vertices associated to DNA recombination

This page was built for publication: The adjoints of DNA graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2485892)