Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Search methods for tile sets in patterned DNA self-assembly
Göös M., Lempiäinen T., Czeizler E., Orponen P. Journal of Computer and System Sciences80 (1):297-319,2014.Type:Article
Date Reviewed: Sep 11 2014

A very important area of nanotechnology--self-assembly--is addressed in this paper. It considers several algorithmic approaches (exhaustive branch and bound, heuristics with some relaxed objectives, and answer set programming) to find a minimal (or near minimal) tile set for any pattern. Each algorithm has its own merits and demerits, but there is no discussion on the implementation aspect of the problem.

There must be some design study on the wet lab implementation of the different tile sets. It would be nice if there were some indication of which of the three algorithms would be more cost effective from a design point of view.

This is a very technically sound paper. The overall treatment is very good, but it would be more attractive, from a practical point of view, if it discussed the wet lab implementation aspects.

Reviewer:  Kumar Ray Review #: CR142707 (1412-1088)
Bookmark and Share
 
Problem Solving, Control Methods, And Search (I.2.8 )
 
 
Automatic Synthesis (B.1.2 ... )
 
 
Geometrical Problems And Computations (F.2.2 ... )
 
 
Life And Medical Sciences (J.3 )
 
Would you recommend this review?
yes
no
Other reviews under "Problem Solving, Control Methods, And Search": Date
The use of a commercial microcomputer database management system as the basis for bibliographic information retrieval
Armstrong C. Journal of Information Science 8(5): 197-201, 1984. Type: Article
Jun 1 1985
Naive algorithm design techniques--a case study
Kant E., Newell A. (ed)  Progress in artificial intelligence (, Orsay, France,511985. Type: Proceedings
Mar 1 1986
SOAR: an architecture for general intelligence
Laird J. (ed), Newell A., Rosenbloom P. Artificial Intelligence 33(1): 1-64, 1987. Type: Article
Aug 1 1988
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy