Pages that link to "Item:Q1401172"
From MaRDI portal
The following pages link to Complexity of DNA sequencing by hybridization. (Q1401172):
Displayed 16 items.
- A hyper-heuristic approach to sequencing by hybridization of DNA sequences (Q367628) (← links)
- A hybrid algorithm for the DNA sequencing problem (Q406500) (← links)
- An integer programming approach to DNA sequence assembly (Q647296) (← links)
- Sequencing by hybridization with isothermic oligonucleotide libraries (Q705498) (← links)
- Selected combinatorial problems of computational biology (Q706944) (← links)
- Evolutionary approaches to DNA sequencing with errors (Q817123) (← links)
- Dealing with repetitions in sequencing by hybridization (Q883811) (← links)
- Finding Hamiltonian circuits in quasi-adjoint graphs (Q955323) (← links)
- A greedy algorithm for the DNA sequencing by hybridization with positive and negative errors and information about repetitions (Q2250888) (← 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)
- An ant colony optimization algorithm for DNA sequencing by hybridization (Q2483507) (← links)
- Computational complexity of isothermic DNA sequencing by hybridization (Q2489897) (← links)
- Tabu search algorithm for DNA sequencing by hybridization with isothermic libraries (Q2490605) (← links)
- A tissue \(P\) system and a DNA microfluidic device for solving the shortest common superstring problem (Q2576612) (← links)
- Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem (Q5439390) (← links)
