Pages that link to "Item:Q2489897"
From MaRDI portal
The following pages link to Computational complexity of isothermic DNA sequencing by hybridization (Q2489897):
Displaying 8 items.
- Sequencing by hybridization with isothermic oligonucleotide libraries (Q705498) (← links)
- Finding Hamiltonian circuits in quasi-adjoint graphs (Q955323) (← 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)
- Tabu search algorithm for DNA sequencing by hybridization with isothermic libraries (Q2490605) (← links)
- Multistage isothermic sequencing by hybridization (Q2500268) (← links)
- (Q4437082) (← links)