The following pages link to On some properties of DNA graphs (Q1961230):
Displaying 27 items.
- On the readability of overlap digraphs (Q266924) (← links)
- Sequencing by hybridization with isothermic oligonucleotide libraries (Q705498) (← links)
- Selected combinatorial problems of computational biology (Q706944) (← links)
- Dealing with repetitions in sequencing by hybridization (Q883811) (← links)
- DNA labelled graphs with DNA computing (Q931505) (← links)
- Finding Hamiltonian circuits in quasi-adjoint graphs (Q955323) (← links)
- On the complexity of recognizing directed path families (Q967290) (← links)
- On a graph-theoretical model for cyclic register allocation (Q1296576) (← links)
- Complexity of DNA sequencing by hybridization. (Q1401172) (← links)
- Graph algorithms for DNA sequencing -- origins, current models and the future (Q1681385) (← links)
- Classification of de Bruijn-based labeled digraphs (Q1686053) (← links)
- On directed covering and domination problems (Q1735678) (← links)
- A method for constructing artificial DNA libraries based on generalized de Bruijn sequences (Q1735684) (← links)
- Recognizing DNA graphs is difficult. (Q1868714) (← links)
- Embedding on alphabet overlap digraphs (Q2267826) (← links)
- Characterizations for some types of DNA graphs (Q2385373) (← links)
- On a generalized model of labeled graphs (Q2446825) (← links)
- A characterization of partial directed line graphs (Q2455584) (← links)
- A polynomial time equivalence between DNA sequencing and the exact perfect matching problem (Q2467125) (← links)
- Characterizing the reconstruction and enumerating the patterns of DNA sequences with re\-peats (Q2471049) (← links)
- The adjoints of DNA graphs (Q2485892) (← links)
- Computational complexity of isothermic DNA sequencing by hybridization (Q2489897) (← links)
- Some indices of alphabet overlap graph (Q2637300) (← links)
- On the circumference of 3-connected cubic triangle-free plane graphs (Q2666403) (← links)
- On the Readability of Overlap Digraphs (Q2942251) (← links)
- On Directed Covering and Domination Problems (Q5136265) (← links)
- Bipartite graphs of small readability (Q5919328) (← links)
