Pages that link to "Item:Q2385373"
From MaRDI portal
The following pages link to Characterizations for some types of DNA graphs (Q2385373):
Displaying 16 items.
- On the readability of overlap digraphs (Q266924) (← links)
- Numerical characterization of DNA sequences: Connectivity type indices derived from DNA line graphs (Q609572) (← links)
- Tree loop graphs (Q876466) (← links)
- DNA labelled graphs with DNA computing (Q931505) (← links)
- On the recognition of de Bruijn graphs and their induced subgraphs (Q1348115) (← links)
- Graph algorithms for DNA sequencing -- origins, current models and the future (Q1681385) (← links)
- Classification of de Bruijn-based labeled digraphs (Q1686053) (← links)
- Recognizing DNA graphs is difficult. (Q1868714) (← links)
- On some properties of DNA graphs (Q1961230) (← links)
- A fast algorithm for the construction of universal footprinting templates in DNA (Q2369299) (← links)
- Four-regular graphs with rigid vertices associated to DNA recombination (Q2446317) (← links)
- On a generalized model of labeled graphs (Q2446825) (← links)
- The adjoints of DNA graphs (Q2485892) (← links)
- On the Readability of Overlap Digraphs (Q2942251) (← links)
- (Q3170710) (← links)
- Bipartite graphs of small readability (Q5919328) (← links)