Generic DNA encoding design scheme to solve combinatorial problems

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

Bibliographic Details
Main Author: Rofilde, Hasudungan
Format: Thesis
Language:English
English
English
Published: 2015
Subjects:
QA75 Electronic computers. Computer science
Online Access:http://umpir.ump.edu.my/id/eprint/17669/
http://umpir.ump.edu.my/id/eprint/17669/
http://umpir.ump.edu.my/id/eprint/17669/1/Generic%20DNA%20encoding%20design%20scheme%20to%20solve%20combinatorial%20problems%20-%20Table%20of%20contents.PDF
http://umpir.ump.edu.my/id/eprint/17669/6/Generic%20DNA%20encoding%20design%20scheme%20to%20solve%20combinatorial%20problems%20-%20Abstract.PDF
http://umpir.ump.edu.my/id/eprint/17669/7/Generic%20DNA%20encoding%20design%20scheme%20to%20solve%20combinatorial%20problems%20-%20References.PDF

Similar Items

Similar Items