PUNCH: An evolutionary algorithm for optimizing bit set selection. Nearly every nucleotide-based computing problem attempted thus far has involved the prearranged assignment of nucleotide sequences to represent bits. However, no general program is yet available to optimize those bit sequences. Careful selection of bit sequences can promote strong annealing between a bit and its intended complement while at the same time minimizing unintended interactions with other bits. In this paper, we present a program that uses an evolutionary algorithm to generate optimum bit sets using given (changeable) criteria. We also test some properties of the program and discuss future applications
References in zbMATH (referenced in 5 articles , 1 standard article )
Showing results 1 to 5 of 5.
- Yang, Shuo; Butt, Ali R.; Fang, Xing; Hu, Y.Charlie; Midkiff, Samuel P.: A fair, secure and trustworthy peer-to-Peer based cycle-sharing system (2006)
- Jonoska, Nataša; Mahalingam, Kalpana; Chen, Junghuei: Involution codes: with application to DNA coded languages (2005)
- Jonoska, Nataša; Mahalingam, Kalpana: Methods for constructing coded DNA languages (2004)
- Kim, Dongmin; Shin, Soo-Yong; Lee, In-Hee; Zhang, Byoung-Tak: NACST/Seq: A sequence design system with multiobjective optimization (2003)
- Ruben, Adam J.; Freeland, Stephen J.; Landweber, Laura F.: PUNCH: An evolutionary algorithm for optimizing bit set selection (2002)