Using DNA to solve the bounded Post correspondence problem

Authors:
Lila Kari;Greg Gloor;Sheng Yu
Affiliations:
Univ. of Western Ontario, London, Ont., Canada;Univ. of Western Ontario, London, Ont., Canada;Univ. of Western Ontario, London, Ont., Canada
Venue:
Theoretical Computer Science - Special issue on universal machines and computations
Year:
2000

Solving NP-Complete Problems With Networks of Evolutionary Processors

IWANN '01 Proceedings of the 6th International Work-Conference on Artificial and Natural Neural Networks: Connectionist Models of Neurons, Learning Processes and Artificial Intelligence-Part I
Is DNA computing viable for 3-SAT problems?

Theoretical Computer Science
Clustering over DNA strings

CIMMACS'06 Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics
Fuzzy forecasting with DNA computing

DNA'06 Proceedings of the 12th international conference on DNA Computing
DNA computing model of graph isomorphism based on three dimensional DNA graph structures

ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part II
DNA-algorithm for timetable problem

International Journal of Bioinformatics Research and Applications

Hi-index	0.00