The following pages link to On some properties of DNA graphs (Q1961230):
Displaying 5 items.
- Dealing with repetitions in sequencing by hybridization (Q883811) (← links)
- Finding Hamiltonian circuits in quasi-adjoint graphs (Q955323) (← links)
- Complexity of DNA sequencing by hybridization. (Q1401172) (← links)
- A polynomial time equivalence between DNA sequencing and the exact perfect matching problem (Q2467125) (← links)
- Computational complexity of isothermic DNA sequencing by hybridization (Q2489897) (← links)
