Back to Results
First PageMeta Content
NP-complete problems / Search algorithms / Operations research / Travelling salesman problem / Hamiltonian path / Tree / Routing algorithms / Bellman–Ford algorithm / Binary tree / Theoretical computer science / Mathematics / Graph theory


Chapter 3 Reconstructing DNA 3.1 Introduction
Add to Reading List

Document Date: 2009-07-03 16:04:35

Open Document

File Size: 157,32 KB

Share Result on Facebook

City

TGAGT / TACGA / TTAC / AGTATTGGCAATC / /

Company

ABC / /

Currency

pence / /

IndustryTerm

final solution / mathematical tool / usual solution / realistic solutions / greedy algorithm / /

Organization

Fragment Assembly / /

/

Position

travelling salesman / Traveling Salesman / /

ProvinceOrState

Connecticut / /

PublishedMedium

Molecular Biology / /

Technology

greedy algorithm / Sequencing by hybridization / hybridization / ATG / approximating algorithm / /

SocialTag