Pages that link to "Item:Q2706948"
From MaRDI portal
The following pages link to Applications of graph theory in DNA sequencing by hybridization (Q2706948):
Displaying 11 items.
- Numerical characterization of DNA sequences: Connectivity type indices derived from DNA line graphs (Q609572) (← links)
- Finding Hamiltonian circuits in quasi-adjoint graphs (Q955323) (← links)
- DNA paired fragment assembly using graph theory (Q1662696) (← links)
- Unimodular hypergraph for DNA sequencing: a polynomial time algorithm (Q2212678) (← links)
- A fast algorithm for the construction of universal footprinting templates in DNA (Q2369299) (← links)
- The adjoints of DNA graphs (Q2485892) (← links)
- (Q3170710) (← links)
- (Q3614324) (← links)
- (Q4422493) (← links)
- Subsequence Combinatorics and Applications to Microarray Production, DNA Sequencing and Chaining Algorithms (Q5307502) (← links)
- (Q5408290) (← links)