Generic DNA encoding design scheme to solve combinatorial problems
Combinatorial problems arise in many areas of computer science and application domains. It involves finding groupings, ordering, or assignment of a discrete; finite set of objects that satisfy given conditions. The complexity of combinatorial problems is classified as NP meaning that algorithms are...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
2015
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/17669/16/Generic%20DNA%20encoding%20design%20scheme%20to%20solve%20combinatorial%20problems.pdf |