The following pages link to The adjoints of DNA graphs (Q2485892):
Displaying 11 items.
- A comparison of graph-theoretic DNA hybridization models (Q418756) (← links)
- DNA labelled graphs with DNA computing (Q931505) (← links)
- Finding Hamiltonian circuits in quasi-adjoint graphs (Q955323) (← links)
- Graph algorithms for DNA sequencing -- origins, current models and the future (Q1681385) (← links)
- Classification of de Bruijn-based labeled digraphs (Q1686053) (← links)
- DNA physical mapping and alternating Eulerian cycles in colored graphs (Q1902468) (← links)
- A fast algorithm for the construction of universal footprinting templates in DNA (Q2369299) (← links)
- Characterizations for some types of DNA graphs (Q2385373) (← links)
- Four-regular graphs with rigid vertices associated to DNA recombination (Q2446317) (← links)
- A DNA-based solution to the graph isomorphism problem using Adleman-Lipton model with stickers (Q2479238) (← links)
- (Q3170710) (← links)