LNCS 2950 - Aspects of Molecular Computing (Frontmatter Pages)

An Algorithm for Testing Structure Freeness of Biomolecular Sequences 277
References
1. L. Adleman, Molecular computation of solutions to combinatorial problems. Science
266, pp.1021–1024, 1994.
2. M. Andronescu, D. Dees, L. Slaybaugh, Y. Zhao, A. Condon, B. Cohen, S. Skiena,
Algorithms for testing that sets of DNA words concatenate without secondary
structure, In Proc. of 8th International Meeting on DNA Based Computers, Lecture
Notes in Computer Science, Vol.2568, Springer, pp.182–195, 2002.
3. M. Arita and S. Kobayashi, DNA sequence design using templates, New Generation
Computing, 20, pp.263–277, 2002.
4. R. Bellman, On a routing problem, Quarterly of Applied Mathematics, Vol.16,
No.1, pp.87–90, 1958.
5. A. Ben-Dor, R. Karp, B. Schwikowski, and Z. Yakhini, Universal DNA tag systems:
A combinatorial design scheme, Proc. of the 4th Annual International Conference
on Computational Molecular Biology (RECOMB2000), pp.65–75, 2000.
6. A. Brenneman, A. E. Condon, Strand design for bio-molecular computation (Survey
paper), Theoretical Computer Science 287 pp.39–58, 2002.
7. R. Deaton, M. Garzon, J.A. Rose, D.R. Franceschetti, R.C. Murphy and
S.E. Jr. Stevens, Reliability and efficiency of a DNA based computation, Physical
Review Letter, 80, pp.417–420, 1998.
8. A. G. Frutos, Q. Liu, A. J. Thiel, A. M. W. Sanner, A. E. Condon, L. M. Smith
and R. M. Corn, Demonstration of a word design strategy for DNA computing on
surfaces, Nucleic Acids Research, Vol.25, No.23, pp.4748–4757, 1997.
9. L.R. Ford, Jr., and D.R. Fulkerson, Flows in Networks, Princeton University Press,
1962.
10. M. Garzon, R. Deaton, J.A. Rose, D.R. Franceschetti, Soft molecular computing,
In Proc. of Fifth International Meeting on DNA Based Computers, June 14-15,
MIT, pp.89–98, 1999.
11. M. Garzon, P. Neathery, R. Deaton, R.C. Murphy, D.R. Franceschetti, and
S.E. Jr. Stevens, A new metric for DNA computing, In Proc. of 2nd Annual Genetic
Programming Conference, Morgan Kaufmann, pp.472–478, 1997.
12. M. Hagiya, Towards molecular programming, in Modeling in Molecular Biology
(ed. by G.Ciobanu), Natural Computing Series, Springer, 2003 (to appear).
13.I.L.Hofacker,W.Fontana,P.F.Stadler,L.S.Bonhoeffer,M.Tacker,P.Schuster,
Fast folding and comparison of RNA secondary structures (The Vienna RNA
package), Monatshefte für Chemie, 125, pp.167–188, 1994.
14. S. Kobayashi, T. Kondo, M. Arita, On template method for DNA sequence design,
In Proc. of 8th International Meeting on DNA Based Computers, Lecture Notes in
Computer Science, Vol.2568, Springer, pp.205–214, 2002.
15. J.A. Rose, R. Deaton, M. Garzon, D.R. Franceschetti, S.E. Jr. Stevens, A statistical
mechanical treatment of error in the annealing biostep of DNA computation, In
Proc. of GECCO-99 conference, pp.1829–1834, 1999.
16. J.A. Rose, R. Deaton, The fidelity of annealing-ligation: a theoretical analysis, In
Proc. of 6th International Meeting on DNA Based Computers, pp.207–221, 2000.
17. D. Sankoff, J.B. Kruskal, S. Mainville, R.J. Cedergren, Fast algorithms to determine
RNA secondary structures containing multiple loops, in Time Warps, String
Edits, and Macromolecules: The Theory and Practice of Sequence Comparison,
D. Sankoff and J. Kruskal, Editors, Chapter 3, pp.93–120, 1983.
18. M. Zuker, P. Steigler, Optimal computer folding of large RNA sequences using
thermodynamics and auxiliary information, Nucleic Acids Research, 9, pp.133–
148, 1981.