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...

Full description

Saved in:
Bibliographic Details
Main Author: Rofilde, Hasudungan
Format: Thesis
Published: 2015
Subjects:
Online Access:http://iportal.ump.edu.my/lib/item?id=chamo:97831&theme=UMP2
http://iportal.ump.edu.my/lib/item?id=chamo:97831&theme=UMP2
http://umpir.ump.edu.my/17669/1/Generic%20DNA%20encoding%20design%20scheme%20to%20solve%20combinatorial%20problems%20-%20Table%20of%20contents.PDF
http://umpir.ump.edu.my/17669/6/Generic%20DNA%20encoding%20design%20scheme%20to%20solve%20combinatorial%20problems%20-%20Abstract.PDF
http://umpir.ump.edu.my/17669/7/Generic%20DNA%20encoding%20design%20scheme%20to%20solve%20combinatorial%20problems%20-%20References.PDF
Tags: Add Tag
No Tags, Be the first to tag this record!