DNA word set design based on minimum free energy

IEEE Transactions on Nanobioscience

Volumn 9, Issue 4, 2010, Pages 273-277

  Zhang, Qiang ^a   Wang, Bin ^a   Wei, Xiaopeng ^a   Fang, Xiaoyong ^a   Zhou, Changjun ^a  

^a DALIAN UNIVERSITY   (China)

Author keywords

DNA computing; DNA word set; minimum free energy

Indexed keywords

BIOMOLECULAR COMPUTING; CODESETS; DATA AND INFORMATION; DNA-COMPUTING; FALSE HYBRIDIZATION REACTIONS; MINIMUM FREE ENERGIES; MINIMUM VALUE; SECONDARY STRUCTURES; SET DESIGN; STATISTICAL NUMBERS;

ALGORITHMS; CALCULATIONS; DNA; FREE ENERGY; OLIGONUCLEOTIDES;

DNA SEQUENCES;

DNA;

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; CHEMISTRY; COMPARATIVE GENOMIC HYBRIDIZATION; DNA MICROARRAY; DNA SEQUENCE; ENERGY TRANSFER; HUMAN; METHODOLOGY;

ALGORITHMS; COMPARATIVE GENOMIC HYBRIDIZATION; DNA; ENERGY TRANSFER; HUMANS; MODELS, GENETIC; OLIGONUCLEOTIDE ARRAY SEQUENCE ANALYSIS; SEQUENCE ANALYSIS, DNA;

EID: 79251559115     PISSN: 15361241     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNB.2010.2069570     Document Type: Article

References (26)

1. L. Adleman, "Molecular computation of solutions to combinatorial problems," Science, vol. 266, pp. 1021-1024, 1994.
2. E. B. Baum, "DNA sequences useful for computation," in Proc. 2nd DIMACS Workshop DNA Based Comput., 1996, pp. 122-127.
3. R. Deaton, R. C. Murphy, J. A. Rose, M. Garzon, D. R. Franceschetti, and S. E. Stevens, Jr., "A DNA based implementation of an evolutionary search for good encodings for DNA computation," in Proc. 1997 IEEE Int. Conf. Evol. Comput., 1997, pp. 267-272.
4. R. Deaton, M. Garzon, R. Murphy, D. Franceschetti, J. Rose, and S. Stevens, Jr., "Information transfer through hybridization reaction in DNA based computing," in Proc. 2nd Annu. Genetic Program. Conf., 1997, pp. 463-471.
5. M. Garzon, P. Neathery, R. Deaton, R. Murphy, D. Franceschetti, and S. Stevens, Jr., "A new metric for DNA computing," in Proc. 2nd Annu. Genetic Programm. Conf. (GP-97), pp. 472-487.
6. D. H. Wood, "Applying error correcting codes to DNA computing," in Proc. 4th DIMACSWorkshop DNA Based Comput., 1998, pp. 109-110.
7. A. J. Hartemink, D. K. Gifford, and J. Khodor, "Automated constraintbased nucleotide sequence selection for DNA computation," in Proc. 4th DIMACS Workshop DNA Based Comput., 1998, pp. 287-297.
8. A. J. Hartemink and D. K. Gifford, "Thermodynamics simulation of deoxyoligonucleotide hybridizes for DNA computation," in Proc. 3rd DIMACS Meeting DNA Based Comput., 1997, pp. 23-25.
9. S. Y. Shin and D. Min, "Evolutionary sequence generation for reliable DNA computing," in Proc. 2002 Congr. Evol. Comput. (CEC'02), vol. 1, pp. 79-84.
10. L. Wenbin, C. H. Lichun, and B. Baogang, "Research on optimizing the template frame in DNA computing," Acta Electronica Sinica, vol. 35, no. 8, pp. 1490-1494, 2007.
11. A. Marathe, A. Condon, and R. Corn, "On combinatorial DNA word design," J. Comput. Biol., vol. l8, no. 3, pp. 201-220, 2001.
12. T. B. Galina, A. E. Brouwer, S. N. Kapralov, and R. J. Patric, "Errorcorrecting codes over an alphabet of four elements," Designs, Codes, Cryptography, vol. 23, no. 3, pp. 333-342, 2001.
13. P. Bottoni, A. Labella, V. Manca, and V. Mitrana, "Superposition based onWatson-Crick-like complementarity," Theory Comput. Syst., vol. 39, pp. 503-524, 2006.
14. D. C. Tulpan, H. H. Hoos, and A. Condon, "Stochastic local search algorithms for DNA word design," in Proc. 8th DNA Based Comput., 2002, vol. 2568, pp. 229-241.
15. Y. M. Chee and S. Ling, "Improved lower bounds for constant GC-content DNA codes," IEEE Trans. Inf. Theory, vol. 54, pp. 391-394, 2008.
16. D. C. Tulpan and H. H. Hoos, "Hybrid randomized neighborhoods improve stochastic local search for DNA code design," in Proc. Advances Artif. Intell., 16th Conf. Can. Soc. Comput. Studies Intelligence, 2003, vol. 2671, pp. 418-433.
17. S. Kawashimo, H. Ono, K. Sadakane, and M. Yamashita, "DNA sequence design by dynamic neighborhood searches," in Proc. DNA Comput., 2006, vol. 4287, pp. 157-171.
18. O. D. King, "Bounds for DNA codes with constant GC-content," J. Combinatorics, vol. 10, pp. 1-13, 2003.
19. P. Gaborit and O. D. King, "Linear constructions for DNA codes," Theory. Comput., vol. 334, pp. 99-113, 2005.
20. R. Montemanni and D. H. Smith, "Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm," J. Math. Model. Algorithms, vol. 7, no. 3, pp. 311-326, 2008.
21. S. Kawashimo, H. Ono, K. Sadakane, and M. Yamashita, "Dynamic neighborhood searches for thermodynamically designing DNA sequence," in Proc. 13th Int. Meet. DNA Comput., 2008, vol. 4848, pp. 130-139.
22. M. Andronescu, Z. Zhang, and A. Condon, "Secondary structure prediction of interacting RNA molecules," J. Mol. Biol. vol. 345, no. 5, pp. 987-1001, 2005 [Online]. Available: www.rnasoft.ca/download.html
23. D. C. Tulpan, M. Andronescu, S. B. Chang, M. R. Shortreed, A. Condon, H. H. Hoos, and L. M. Smith, "Thermodynamically based DNA strand design," Nucleic Acids Res., vol. 33, no. 15, pp. 4951-4964, 2005.
24. M. Garzon, V. Phan, S. Roy, and A. Neel, "Search of optimal codes for DNA computing," in Proc. DNA Comput., 2006, vol. 4287, pp. 143-156.
25. A. D'yachkov, A. Macula, V. Rykov, and V. Ufimtsev, "DNA codes based on stem similarities between DNA sequences," in Proc. 13th Int. Meet. DNA Comput., 2008, vol. 4848, pp. 146-151.
26. M. R. Shortreed, S. B. Chang, D. G. Hong, M. Phillips, B. Campion, D. C. Tulpan, M. Andronescu, A. Condon, H. H. Hoos, and L. M. Smith, "A thermodynamic approach to designing structure-free combinatorial DNA word sets," Nucleic Acids Res., vol. 33, no. 15, pp. 4965-4977, 2005.