[Aita01AROB]
T. Aita and Y. Husimi.
Fitness landcape of biopolymers and efficient optimization strategy in
evolutionary molecular engineering.
Proc. of 6th Int. Sympo. on A-life and Robotics, Vol.6, 2001,
pp.365--368.
[$BIz8+(B01$BJ#;(7O(B]
$BIz8+>y(B, $B;MJ}E/Li(B.
$BBPCL!V9=@.E*@8J*3X!W(B.
in $B6b;RK.I'JT(B $B%7%j!<%:!&%K%e!<%P%$%*%U%#%8%C%/%9-6(B
$B!VJ#;(7O$N%P%$%*%U%#%8%C%/%9!W(B, $BBh(B7$B4,(B, $B6&N)=PHG(B, 2001,
in press.
[Aita00JTB]
T. Aita and Y. Husimi.
Theory of an Evolutionary Molecular Engineering using Simultaneous
Accumulation of Advantageous Mutations.
J. Theoret. Biol., Vol.207, 2000,
pp.543--556.
[Aita00JMB]
T. Aita and Y. Husimi.
Adaptive walks by the fittest among finite random mutants
on the Mt.Fuji-type fitness Landscape II: The effect of small nonadditivity.
J. Math. Biol., Vol.41, 2000,
pp.207--231.
[Aita00JME]
T. Aita, S. Urata and Y. Husimi.
From amino acid landscape to protein landscape:
Analysis of genetic codes in terms of fitness landscape.
J. Mol. Evol., Vol.50, 2000,
pp.313--323.
[Aita00Biopolymers]
T. Aita, H. Uchiyama, T. Inaoka, M. Nakajima and Y. Husimi.
Analysis of local fitness landscapes with a model of
the rough Mt.Fuji-type landscape:
Application to prolyl endopeptidase and thermolysin.
Biopolymers, Vol.54, 2000,
pp.64--79.
[Aita98JTB]
A. Aita and Y. Husimi.
Fitness landscape for a biopolymer participating in a multi-step reaction.
J. Theor. Biol., Vol.191, 1998,
pp.337--390.
[Aita98JTB']
A. Aita and Y. Husimi.
Adaptive walks by the fittest among finite random mutants on
the Mt.Fuji-type fitness landscape.
J. Theor. Biol., Vol.193, 1998,
pp.383--405.
[Aita96JTB]
A. Aita and Y. Husimi.
Fitness spectrum among random mutants on Mt.Fuji-type fitness landscape.
J. Theor. Biol., Vol.182, 1996,
pp.469--485.
[Arita00GECCO]
M. Arita, A. Nishikawa, M. Hagiya, K. Komiya H. Gouzu and
K. Sakamoto.
Improving Sequence Design for DNA Computing.
Proceedings of the Gnenetic and Evolutionary Computation Conference
(GECCO 2000), 2000,
pp.875--882. [Arita00GCB]
M. Arita, K. Asai, and T. Nishioka.
Reconstructing Metabolic Pathways with New Enzyme Classification.
German Conference in Bioinformatics (GCB'00), 2000,
pp.99-106. [Arita00SPT]
M. Arita.
Metabolic Reconstruction using Shortest Paths.
Simulation Practice and Theory, Vol.8, No.2, 2000,
pp.109-125.
[Arita00JSAI]
M. Arita.
Graph Modeling of Metabolism,
Journal of Japanese Society for Artificial Intelligence (JSAI),
Vol.15, No.4, 2000,
pp.703--710.
[$BM-ED(B00$B?tM}2J3X(B]
$BM-ED@55,(B.
DNA$B7W;;$K$*$1$kG[Ns@_7W(B.
$B?tM}2J3X(B, No.445 (7$B7n9f(B), $B%5%$%(%s%9 [$BM-ED(B00$B%2%N%`>pJs@8J*3X(B]
$BM-ED@55,(B.
$BBe [Arita99GIW]
M. Arita, K. Asai, and T. Nishioka.
Finding Precursor Compounds in Secondary Metabolism.
Genome Informatics 1999, Genome Informatics Series, No.10,
Universal Academy Press, Inc., Tokyo, Japan, 1999,
pp.113--120.
[Arita97GP]
Masanori Arita, Akira Suyama and Masami Hagiya.
A Heuristic Approach for Hamiltonian Path Problem with Molecules.
Proceedings of 2nd Genetic Programming (GP-97), 1997,
pp.457--462. [Arita97ICEC]
Masanori Arita, Masami Hagiya and Akira Suyama.
Joining and Rotating Data with Molecules,
IEEE International Conference on Evolutionary Computation, 1997,
pp.243--248. [Eli99JB]
P. Eli, K. Nishigaki and Y. Husimi.
Characterization of imidazole as a DNA denaturant by using TGGE of
PCR products from a random pool of DNA.
J. Biochem., Vol.125, 1999,
pp.790--794.
[Eli98CL]
P. Eli and Y. Husimi.
Imidazole improves specificity of PCR by suppressing product-priming outgrowth.
Chem. Lett., Vol.1998, 1998,
pp.683--684.
[$BGkC+(B01$BF|K\J*M}3X2q;o(B]
$BGkC+>;8J(B, $BM-ED@55,(B.
$BJ,;R7W;;(B.
$BF|K\J*M}3X2q;o(B, 2001,
to appear.
[$BGkC+(B01bit]
$BGkC+>;8J(B.
$BFC=8(B $BL$MhM=A[(B --- 2050$BG/$"$k$b$N$J$$$b$N(B, $B%3%s%T%e!<%?%5%$%(%s%9(B.
bit, Vol.33, No.11, 2001.
pp.18--21.
[$BGkC+(B01$B7WB,$H@)8f(B]
$BGkC+>;8J(B.
$BJ,;R7W;;$+$iJ,;R%W%m%0%i%_%s%0$X(B.
$B7WB,$H@)8f(B, Vol.40, No.1, 2001,
pp.100--105. [$BGkC+(B00MPS]
$BGkC+>;8J(B, $B>.5\7r(B, $B:dK\7r:n(B.
SAT Engine$B$N7W;;NL(B --- $B3NN(%"%k%4%j%:%`$H$7$F$N(BDNA$B%"%k%4%j%:%`(B ---.
$B?7$7$$7W;;%Q%i%@%$%`%7%s%]%8%&%`(B2000 $BO@J8=8(B,
$B>pJs=hM}3X2q%7%s%]%8%&%`%7%j!<%:(B, Vol.2000, No.16, 2000,
pp.109--114. [Hagiya01LNCS]
Masami Hagiya.
From Molecular Computing to Molecular Programming,
DNA6, Sixth International Meeting on DNA Based Computers,
Lecture Notes in Computer Science, 2001,
to appear. [$BGkC+(B00$B0dEAE*%"%k%4%j%:%`(B]
$BGkC+>;8J(B, $B@>@nL@CK(B.
DNA$B7W;;(B,
$B0dEAE*%"%k%4%j%:%`(B4, $BBh(B1$B>O(B, $BKLLn9(L@JTCx(B,
$B;:6H?^=q(B, 2000,
pp.3--48.
[$BGkC+(B00$B?.3X2q;o(B]
$BGkC+>;8J(B, $B@>@nL@CK(B.
DNA$B7W;;$H$O2?$+(B.
$BEE;R>pJsDL?.3X2q;o(B, Vol.83, No.10, 2000,
pp.756--762.
[$BGkC+(B00$B?tM}2J3X(B]
$BGkC+>;8J(B.
$BJ,;R%3%s%T%e!<%F%#%s%0$+$iJ,;R%W%m%0%i%_%s%0$X(B.
$B?tM}2J3X(B, No.445 (7$B7n9f(B), $B%5%$%(%s%9 [$BGkC+(B99$BF|K\%U%!%8%#3X2q;o(B]
$BGkC+>;8J(B, $B@>@nL@CK(B.
$BJ,;R7W;;$+$i8+$?JB9T7W;;(B --
Making Chemical Abstract Machines More Chemical --,
$BF|K\%U%!%8%#3X2q;o(B, Vol.11, No.1, 1999,
pp.2--13. [Hagiya99NGC]
Masami Hagiya.
Perspectives on Molecular Computing.
New Generation Computing, Vol.17, 1999,
pp.131--151. [Hagiya99DIMACS]
Masami Hagiya, Masanori Arita, Daisuke Kiga,
Kensaku Sakamoto and Shigeyuki Yokoyama.
Towards Parallel Evaluation and Learning of Boolean
$B&L(B-Formulas with Molecules.
DNA Based Computers III, DIMACS Series in Discrete Mathematics and
Theoretical Computer Science, Vol.48, 1999,
pp.57--72. [Hagiya98GP]
Masami Hagiya.
Towards Autonomous Molecular Computers.
Genetic Programming 1998:
Proceedings of the Third Annual Conference, Morgan Kaufmann, 1998,
pp.691-699. [Hagiya98$B<+N'J,;6(B]
$BGkC+>;8J(B.
$B<+N'E*(BDNA$B%3%s%T%e!<%?(B.
$BBh(B10$B2s<+N'J,;6%7%9%F%`!&%7%s%]%8%&%`;qNA(B,
($B [Hagiya97DNA]
Masami Hagiya, Masanori Arita, Daisuke Kiga, Kensaku Sakamoto and
Shigeyuki Yokoyama.
Towards Parallel Evaluation and Learning of
Boolean $B&L(B-Formulas with Molecules,
Preliminary Proceedings,
3rd DIMACS Workshop on DNA Based Computers,
University of Pennsylvania,
June 23 - June 25, 1997,
pp.105-114. [$BGkC+(B97$B?M9)CNG=3X2qA49qBg2q(B]
$BGkC+>;8J(B.
$BJ,;R%3%s%T%e!<%?$NM}O@$H9=C[(B.
$B?M9)CNG=3X2qA49qBg2q(B($BBh(B11$B2s(B)$BO@J8=8(B, 1997,
pp.9--17. [$BGkC+(B96$B>pJs=hM}(B]
$BGkC+>;8J(B.
$B@8J*$N7O$N%b%G%k2=$H%7%_%e%l!<%7%g%s(B: $B$=$N0U5A$H8&5fJ}8~(B.
$BFC=8(B:$B!V%2%N%`>pJs!W(B, $B>pJs=hM}(B, Vol.37, No.10, $B>pJs=hM}3X2q(B, 1996,
pp.941--945.
[Head99CEC]
T. Head, M. Yamamura, and S. Gal.
Aqueous Computing -- Writing on Molecules.
Proc. CEC'99, 1999,
pp.1006--1010.
[$BHu8}(B01$B?M9)CNG=3X2q;o(B]
$BHu8}N41Q(B, $B;3B<2m9,(B, $BE{0fLP5A(B.
$B$B?M9)CNG=3X2q;o(B, Vol.16, No.1, 2001,
pp147--155.
[Higuchi00PPSN]
T. Higuchi, S. Tsutsui, and M. Yamamura.
Theoretical Analysis of Simplex Crossover for Real-Coded Genetic Algorithms.
Proc PPSN VI, 2000,
pp.365--374.
[$BIz8+(B00$B@8J*J*M}(B]
$BIz8+>y(B.
$B%2%N%`>pJs2J3X$H?J2=9)3X(B.
$B@8J*J*M}(B, Vol.40, 2000,
pp.17--18.
[$BIz8+(B00$B%P%$%*%_%a%F%#%C%/%9(B]
$BIz8+>y(B, $B;3K\M5Fs!$0KF#MN0lO:(B.
in vitro $B<+8JA}?#7O(B.
$BD9ED(B $B5A?NJT(B $B!V%P%$%*%_%a%F%#%C%/%9!&%O%s%I%V%C%/!W(B, NTS$B!$(B2000,
pp.377--385.
[$BIz8+(B00$B?tM}2J3X(B]
$BIz8+>y(B, $BAjEDBsMN(B.
$B0dEA%3!<%I$NJ*M}(B---$B [$BIz8+(B99$B@8J*J*M}(B]
$BIz8+>y(B.
$B@8L?$N5/8;$H?J2=!'$b$&0l$D$N8+J}(B.
$B@8J*J*M}(B, Vol.39, 1999,
pp.40--41.
[$BIz8+(B99$B#2#0@$5*$NJ*M}3X(B]
$BIz8+>y(B.
$BBh#2#5>O(B $B@8J*J*M}(B.
$B!V#2#0@$5*$NJ*M}!WJT=80Q0w2qJT!V#2#0@$5*$NJ*M}3X!WBh#34,(B, $B4]A1(B, 1999,
pp.601--627.
[$BIz8+(B99$B2=3X$H@8J*(B]
$BIz8+>y(B.
$B!VCAGr$B2=3X$H@8J*(B, Vol.37, 1999,
pp.678--684.
[$BIz8+(B98Academia]
$BIz8+>y(B.
$B0dEA>pJs$N5/8;$H?J2=$N [$BIz8+(B97$BF|K\J*M}3X2q;o(B]
$BIz8+>y(B, $B:,K\D>?M!%(B
$B?J2=J,;R9)3X$N$9$9$a!'@8BN9bJ,;R5!G=$NAO=P$H@8L?$N5/8;$X$N%"%W%m!<%A(B.
$BF|K\J*M}3X2q;o(B, Vol.52$B!$(B1997,
pp.680--686.
[$B:#0f(B00MPS]
$B:#0fM5;K(B, $B:g869/J8(B.
$B%V!<%k<03X=,$r9T$&(BDNA$B7W;;%"%k%4%j%:%`$N%7%_%e%l!<%?$K$h$k8!>Z(B.
$B?7$7$$7W;;%Q%i%@%$%`%7%s%]%8%&%`(B2000 $BO@J8=8(B,
$B>pJs=hM}3X2q%7%s%]%8%&%`%7%j!<%:(B, Vol.2000, No.16, 2000,
pp.123--130.
[Ito00Gene]
Y. Ito, M. Suzuki and Y. Husimi.
A novel T-vector using green fluorescent protein as an indicator.
Gene, Vol.245, 2000,
pp.67--77.
[Ito99BBRC]
Y. Ito, M. Suzuki and Y. Husimi.
A green fluorescent protein with mutation of enhanced fluorescence at
488nm excitation.
Biophys. Biochem. Res. Comm., Vol.264, 1999,
pp.556--560.
[Kari97$B?.3X2q;o(B]
Lila Kari, $B:g869/J8(B.
DNA$B%3%s%T%e!<%?$H$O(B $B!]?7$7$$7W;;5!$N2DG=@-$K8~$1$F(B.
$BEE;R>pJsDL?.3X2q;o(B, Vol.80, No.9, 1997,
pp.935--939.
[Kiga98NAR]
D. Kiga, Y. Futamura, K. Sakamoto, S. Yokoyama.
An RNA aptamer to the xanthine/guanine base with a distictive mode of
purine recognition.
Nucleic Acids Res., Vol.26, 1998,
pp.1755-1760.
[Kimoto98FEBS]
M. Kimoto, K. Sakamoto, M. Shirouzu, I. Hirao, S. Yokoyama.
RNA aptamers that specifically bind to the Ras-binding domain of Raf-1.
FEBS Lett., Vol.441, 1998,
pp.322--326.
[Kinoshita97NAR]
Y. Kinoshita, K. Nishigaki and Y. Husimi.
Fluorescence-, isotope- or biotin-labeling of the 5'-end of
single-stranded DNA/RNA using T4 RNA ligase.
Nucleic Acids Res., Vol.25, 1997,
pp.3747--3748.
[Kobayashi01TCS]
S. Kobayashi, V. Mitrana, Gh. Paun and G. Rozenberg.
Formal Properties of PA-Matching.
Theoretical Computer Science,
accepted for publication.
[Kobayashi01TCS']
Satoshi Kobayashi and Yasubumi Sakakibara.
Multiple Splicing Systems and the Universal Computability.
Theoretical Computer Science,
accepted for publication.
[Kobayashi00Multiset]
S. Kobayashi.
Concentration Prediction of Pattern Reaction Systems.
Pre-Proc. of Workshop on Multiset Processing,
CDMTS Research Report Series 140 (Univ. of Auckland),
August, 2000,
pp.112--123. [$B>.NS(B00$B?tM}2J3X(B]
$B>.NSAo(B, $B:g869/J8(B, $B2#?95.(B.
$BJ,;R7W;;$NM}O@%b%G%k(B.
$B?tM}2J3X(B, No.445 (7$B7n9f(B), $B%5%$%(%s%9 [Kobayashi97ICEC]
Satoshi Kobayashi, Takashi Yokomori,
Gen-ichi Sampei and Kiyoshi Mizobuchi.
DNA Implementation of Simple Horn Clause Computation.
Proc. of IEEE International Conference on
Evolutionary Computation'97, 1997,
pp.213--217. [Komiya00DNA]
Ken Komiya, Kensaku Sakamoto, Hidetaka Gouzu, Shigeyuki Yokoyama,
Masanori Arita, Akio Nishikawa and Masami Hagiya.
Successive State Transitions with I/O Interface by Molecules.
DNA6, Sixth International Meeting on DNA Based Computers,
Preliminary Proceedings, 2000,
pp.21--30.
[Kurata99GIW]
K. Kurata and A. Suyama.
Probe design for DNA chips.
Genome Informatics 1999, Genome Informatics Series, No.10,
Universal Academy Press, Inc., Tokyo, Japan, 1999,
pp.225--226.
[Morimoto99DIMACS]
N. Morimoto, M. Arita and Akira Suyama.
Solid-Phase DNA Solution to the Hamiltonian Path Problem.
DIMACS$B!!(BSeries in Discrete Mathematics and Theoretical Computer Science,
Vol.48, 1999,
pp.193--206. [Morimoto97DNA]
N. Morimoto, M. Arita and A. Suyama.
Solid-Phase DNA Solution to the Hamiltonian Path Problem.
Preliminary Proceedings,
3rd DIMACS Workshop on DNA Based Computers,
University of Pennsylvania,
June 23 - June 25, 1997,
pp.83--92.
[Morimoto97BCEC]
N. Morimoto, M. Arita and A. Suyama.
Stepwise Generation of Hamiltonian Path with Molecules.
Proc. of Biocomputing and Emergent Computation, 1997,
pp.184--192.
[$BCfEg(B00MPS]
$BCfEgN4IW(B, $B [Nemoto97FEBS]
N. Nemoto, E. Miyamoto-Sato, Y. Husimi and H. Yanagawa.
In vitro virus: Bonding of mRNA bearing puromycin at the 3'-terminal end
to the C-terminal end of its encoded protein on the ribosome in vitro.
FEBS Lett., Vol.414, 1997,
pp.405--408.
[Nishikawa01SC]
Akio Nishikawa, Masayuki Yamamura and Masami Hagiya.
DNA Computation Simulator Based on Abstract Bases.
Soft Computing, 2001,
in press. [$B@>@n(B00MPS]
$B@>@nL@CK(B, $BM-ED@55,(B, $B;09%D>?M(B, $BGkC+>;8J(B.
DNA$B7W;;$N1v4pG[Ns@_7W$K$*$1$k%P%i%s%9$N;XI8$K$D$$$F(B.
$B?7$7$$7W;;%Q%i%@%$%`%7%s%]%8%&%`(B2000 $BO@J8=8(B,
$B>pJs=hM}3X2q%7%s%]%8%&%`%7%j!<%:(B, Vol.2000, No.16, 2000,
pp.67--69. [$B@>@n(B00MPS']
$B@>@nL@CK(B, Sonia Antoranz Contera, $BJ885oD(B, $B5H?.C#IW(B, $B4d:jM5(B.
AFM$B$K$h$k%J%N%F%/%N%m%8!<$H(BDNA$B7W;;$K$h$k%Q%?!<%s7A@.5;=Q$NE}9g$N;n$_(B.
$B?7$7$$7W;;%Q%i%@%$%`%7%s%]%8%&%`(B2000 $BO@J8=8(B,
$B>pJs=hM}3X2q%7%s%]%8%&%`%7%j!<%:(B, Vol.2000, No.16, 2000,
pp.95--100. [$B@>@n(B00$B?tM}2J3X(B]
$B@>@nL@CK(B, $BGkC+>;8J(B.
DNA$B7W;;$N$?$a$N%7%_%e%l!<%7%g%s$N;n$_(B.
$B?tM}2J3X(B, No.445 (7$B7n9f(B), $B%5%$%(%s%9 [Nishikawa99CEC]
Akio Nishikawa and Masami Hagiya.
Towards a System for Simulating DNA Computing with Whiplash PCR.
CEC'99, Congress on Evolutionary Computation, 1999,
pp.960--966.
[Park00BRGS]
S. J. Park, and M. Yamamura.
Using Genetic Algorithm to Detect Structural Similarities in Proteins.
Proc. BRGS2000, Vol.2, 2000,
pp.201--203.
[Paun00JUCS]
G. Paun and T. Yokomori.
Simulating H systems by P systems.
Journal of Universal Computer Science, Vol.6, No.1, 2000,
pp.178--193.
[Paun99DNA]
Gh. Paun and T. Yokomori.
Membrane Computing Based on Splicing.
Proc. of 5th DIMACS Workshop on DNA Based Computers, MIT, USA,
June, 1999,
pp.213--227.
[Rose00MPS]
John A. Rose, Akira Suyama, Masami Hagiya and Russel J. Deaton.
An Antisense Antidote for Whiplash PCR,
IPSJ Symposium Series, Vol.2000, No.16,
Information Processing Society of Japan, 2000,
pp.101--108.
[Rose00DNA]
J. A. Rose, R. J. Deaton.
The fidelity of annealing-ligation: A theoretical analysis.
DNA6, Sixth International Meeting on DNA Based Computers,
Preliminary Proceedings, 2000,
pp.207--221.
[Sakakibara01SC]
Yasubumi Sakakibara and Satoshi Kobayashi.
Sticker Systems with Complex Structures.
Soft Computing,
accepted for publication.
[Sakakibara00GIW]
Yasubumi Sakakibara and Akira Suyama.
Intelligent DNA Chips: Logical operation of gene expression profiles
on DNA computers.
Genome Informatics 2000, Genome Informatics Series, No.11,
Universal Academy Press, Inc., Tokyo, Japan, 2000,
pp.33--42.
[Sakakibara00DNA]
Yasubumi Sakakibara.
Solving computational learning problems of Boolean formulae
on DNA computers.
DNA6, Sixth International Meeting on DNA Based Computers,
Preliminary Proceedings, 2000,
pp.193--204.
[$B:g86(B00$B>pJs=hM}(B]
$B:g869/J8(B.
$BF;$7$k$Y!'(B DNA$B%3%s%T%e!<%?D6F~Lg(B
--$B%7%j%3%s$+$i;n834I$NCf$N%3%s%T%e!<%?$X(B.
$B>pJs=hM}(B, Vol.41, No.2, $B>pJs=hM}3X2q(B, 2000,
pp.204--207.
[Sakakibara99TCS]
Yasubumi Sakakibara and Claudio Ferretti.
Splicing on Tree-like Structures.
Theoretical Computer Science, Vol.210, 1999,
pp.227--243.
[Sakakibara98JPST]
Yasubumi Sakakibara.
DNA Computers: A New Computing Paradigm.
Journal of Photopolymer Science and Technology, Vol.11, No.4, 1998,
pp.681--686.
[$B:g86(B98$B%W%m%7%s(B]
$B:g869/J8(B, $BGkC+>;8J(B, $B2#?95.(B.
DNA$B%3%s%T%e!<%?(B: $B$=$N8=>u$H2DG=@-(B.
$B>pJs=hM}3X2q(B $BBh#3#92s%W%m%0%i%_%s%0!&%7%s%]%8%&%`Js9p=8(B, 1998$BG/(B1$B7n(B,
pp.21--30.
[$B:dK\(B00MPS]
$B:dK\7r:n(B, $B>.5\7r(B, $B2#;3LPG7(B, $BGkC+>;8J(B.
DNA$BJ,;R$N<+8J2q9gH?1~$N2r@O(B.
$B?7$7$$7W;;%Q%i%@%$%`%7%s%]%8%&%`(B2000 $BO@J8=8(B,
$B>pJs=hM}3X2q%7%s%]%8%&%`%7%j!<%:(B, Vol.2000, No.16, 2000,
pp.115--121.
[$B:dK\(B00bit]
$B:dK\7r:n(B.
DNA$B%3%s%T%e!<%?$G(BNP$B40A4LdBj$r2r$/(B.
bit, Vol.32, No.12, 2000,
pp.54--61.
[$B:dK\(B00$B?tM}2J3X(B]
$B:dK\7r:n(B.
$B@8BNJ,;R$H7W;;(B.
$B?tM}2J3X(B, No.445 (7$B7n9f(B), $B%5%$%(%s%9 [Sakamoto99BioSystems]
Kensaku Sakamoto, Daisuke Kiga, Ken Komiya, Hidetaka Gouzu,
Shigeyuki Yokoyama, Shuji Ikeda, Hiroshi Sugiyama, and
Masami Hagiya.
State Transitions by Molecules.
BioSystems, Vol.52, No.1--3, 1999,
pp.81--91. [Sakamoto98DNA]
Kensaku Sakamoto, Daisuke Kiga, Ken Komiya,
Hidetaka Gouzu, Shigeyuki Yokoyama, Shuji Ikeda, Hiroshi Sugiyama, and
Masami Hagiya.
State Transitions by Molecules.
Preliminary Proceedings,
Fourth International Meeting on DNA Based Computers,
University of Pennsylvania,
June 15 - June 19, 1998,
pp.87-99.
[$B:dK\(B98$B9=B$@8J*3X(B]
$B:dK\7r:n!$2#;3LPG7(B.
$BHsE7A37?%"%_%N;@$r4^$`%?%s%Q%/$B9=B$@8J*3X(B, $B;01:6`0lO:JT(B, $BD+AR=qE9(B, 1998,
pp.61--67.
[Someya99GECCO]
H. Someya, and M. Yamamura.
A Genetic Algorithm without Parameters Tuning and its Application on
the Floorplan Design Problem.
Proceedings of the Genetic and Evolutionary Computation Conference
(GECCO'99), Vol.1, 1999,
pp.620--627.
[$B@wC+(B99$BEE5$3X2qO@J8;o(B]
$B@wC+Gn;J(B, $B;3B<2m9,(B.
$BC5:wNN0h$rE,1~E*$KD4@0$9$k0dEAE*%"%k%4%j%:%`$K$h$k%U%m%"%W%i%s@_7WLdBj$N0l2rK!(B,
$BEE5$3X2qO@J8;o(BC, Vol.119-C, No.3, 1999,
pp.393--403.
[$BF+;3(B00$B?tM}2J3X(B]
$BF+;3L@(B.
$BJ,;R%3%s%T%e!<%?$N [Suyama00$B>pJs=hM}3X2q%Q%M%k(B]
$BF+;3L@(B.
DNA$B%3%s%T%e!<%?$N [$BF+;3(B99$B<+N'J,;6(B]
$BF+;3L@(B, $B5HED42(B.
$BBh(B1.5$B@$Be(BDNA$B%3%s%T%e!<%?$N9=C[(B.
$BBh(B11$B2s<+N'J,;6%7%9%F%`!&%7%s%]%8%&%`MW;]=8(B, 1999,
pp.73--76.
[$BF+;3(B99$B%Q%j%F%#(B]
$BF+;3L@(B.
DNA$B%A%C%W!'(BIC$B3WL?$N%P%$%*$K$*$1$k:F8=$+(B?
$B%Q%j%F%#(B, Vol.14 No. 12, 1999,
pp.6--8.
[Suyama97Micromachine]
A. Suyama.
DNA Chips - Integrated Chemical Circuits for DNA Diagnosis and DNA Computers.
Proc. of Third International Micromachine Symposium,, 1997,
pp.7--12. [$BF+;3(B97$B%Q%j%F%#(B]
$BF+;3L@(B.
DNA$B$rMQ$$$?<+8JAH?%2=%J%N:`NA3+H/(B.
$B%Q%j%F%#(B, Vol.12, No. 2, 1997,
pp.42--43.
[Takano99JACS]
M. Takano, T. Yamato, J. Higo, A. Suyama, K. Nagayama.
Molecular dynamics of a 15-residue Poly(L-alanine) in water:
Helix formation and energetics.
J. Amer. Chem. Soc., Vol. 121, 1999,
pp. 605--612.
[Tsutsui99GECCO]
S. Tsutsui, M. Yamamura, and T. Higuchi.
Multi-parent Recombination with Simplex Crossover in
Real Coded Genetic Algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference
(GECCO'99), Vol.1, 1999,
pp.657--664.
[Yamamoto01CL]
Y. Yamamoto, S. Komiya and Y. Husimi.
Stabilized 3SR against evolutionary instability.
Chem. Lett, 2001,
submitted.
[Yamamoto01DIMACS]
Y. Yamamoto, M. Suzuki and Y. Husimi.
Dynamics in a 3SR evolution reactor and its applications.
DIMACS Series in Discrete Mathematics and
Theoretical Computer Science, 2001,
in press.
[$B;3B<(B00MPS]
$B;3B<2m9,(B.
DNA-PNA$B%O%$%V%j%C%I$K$h$k%"%/%(%"%9!&%3%s%T%e!<%F%#%s%0$N [$B;3B<(B00$B0dEAE*%"%k%4%j%:%`(B]
$B;3B<2m9,(B, Tom Head, Susannah Gal.
$B%"%/%(%"%9!&%3%s%T%e!<%F%#%s%0!]J,;R%a%b%j$N7W;;86M}$HJ,;R@8J*3XE* [$B;3B<(B00$B?tM}2J3X(B]
$B;3B<2m9,(B.
$BJ,;R%a%b%j!$B?tM}2J3X(B, No.445 (7$B7n9f(B), $B%5%$%(%s%9 [Yamamura97JCIS]
M. Yamamura$B!$(BH. Satoh$B!$(Band S. Kobayashi.
A Markov Analysis of Generation Alternation Models on
Minimal Deceptive Problems.
Proc. JCIS'97, Vol.1, 1997,
pp.47--50.
[Yamamura96ICEC]
M. Yamamura, I. Ono, and S. Kobayashi.
Emergent Search on Double Circle TSPs using Subtour Exchange Crossover.
Proc. ICEC'96, 1996,
pp.535--540.
[Yokomori00TCS]
C. Ferretti, G. Mauri, S. Kobayashi and T.Yokomori.
On the Universality of Post and Splicing Systems.
Theoretical Computer Science, Vol.231, 2000,
pp.157--170.
[$B2#?9(B00CT]
$B2#?95.(B.
$BJ,;R%3%s%T%e!<%F%#%s%0(B -- $BM}O@%b%G%k$N:GA0@~(B.
Computer Today, No.100 (11$B7n(B), $B%5%$%(%s%9 [Yokomori99$BLuK\(B]
$B2#?9(B $B5.!&:g869/J8!&>.NS(B $BAo!J6&Lu!K!'(B DNA$B%3%s%T%e!<%F%#%s%0(B----
$B?7$7$$7W;;%Q%i%@%$%`!J(BPaun, Rozenberg, Salomaa $B6&Cx!K(B,
$B%7%e%W%j%s%,!<%U%'%"%i!<%/El5~(B, 1999 $BG/(B12$B7n(B.
[Yokomori99DLT]
T. Yokomori.
Computation = Self-assembly+Conformational Change:
Toward New Computing Paradigms.
Proc. of 4th International Conference on Developments in
Language Theory(DLT'99), Aachen, July, 1999,
pp.21--30. [Yokomori99DNA]
T. Yokomori.
YAC: Yet Another Computation Model of Self-Assembly,
Proc. of 5th DIMACS Workshop on DNA Based Computers, MIT, USA,
June, 1999,
pp.153--167. [$B2#?9(B99FAI]
$B2#?95.(B.
$BJ,;R%3%s%T%e!<%F%#%s%0(B -- $B?77W;;%Q%i%@%$%`$NC55f(B.
$B?M9)CNG=3X2q8&5f2q>7BT9V1i!$(BSIG-FAI-9804-13$B!$(B1999$BG/(B3$B7n(B,
pp.79--88.
[$B2#?9(B97bit]
$B2#?95.(B.
Bio-Computing$B$C$F$J$s$@$m$&!)(B --
$B5UE>$NH/A[!'J,;R%3%s%T%e!<%?$rL\;X$7$F(B.
bit, Vol.29, No.8, 1997,
pp.34--38.
[Yokomori97DNA]
T. Yokomori and S. Kobayashi.
DNA-EC: A Model of DNA-Computing Based on Equality Checking.
Proc. of 3rd DIMACS Workshop on DNA Based Computers,
Philadelphia, USA, June, 1997,
pp.334--347. [Yokomori97ICEC]
T. Yokomori, S. Kobayashi and C. Ferretti.
On the power of circular splicing systems and DNA computatibility.
Proc. of IEEE Intern. Conference on Evolutionary
Computation, Indianapolis, USA, April, 1997,
pp.219--224. [$B2#?9(B96$B>pJs=hM}(B]
$B2#?95.(B, $B>.NSAo(B.
$B7W;;O@E*8@8lM}O@$H(BDNA$B7W;;(B.
$B>pJs=hM}(B, Vol.37, No.10, $B>pJs=hM}3X2q(B, 1996,
pp.929--934.
[$B5HED(B00MPS]
$B5HED42(B, $BF+;3L@(B.
$B$[$\<+8JAj;w$J9=B$BN$rMQ$$$?7W;;$K$D$$$F(B.
$B?7$7$$7W;;%Q%i%@%$%`%7%s%]%8%&%`(B2000 $BO@J8=8(B,
$B>pJs=hM}3X2q%7%s%]%8%&%`%7%j!<%:(B, Vol.2000, No.16, 2000,
pp.87--90.
[Yoshida00DIMACS]
H. Yoshida and A. Suyama.
Solution to 3-SAT by breadth first search.
DIMACS Series in Discrete Mathematics and Theoretical Computer Science,
Vol.54, 2000,
pp.9--22.
[Yoshida99DNA]
H. Yoshida and A. Suyama.
Solution to 3-SAT by Breadth First Search,
Proc. of Fifth International Meeting on DNA Based Computers, MIT, USA,
June, 1999,
pp.9--20.
[Adleman94Science]
L. M. Adleman.
Molecular Computation of Solutions to Combinatorial Problems,
Science, Vol.266, 1994,
pp.1021--1024.
[Head99PatternFormation]
T. Head.
Circular suggestions for DNA computing.
Pattern Formation in Biology, Vision and Dynamics
(A. Carbone, M. Gromov, P. Pruzinkiewcz, eds.), World Scientific,
Singapore and London, 1999,
pp.325--335.
[Head00BioSystems]
T. Head, G. Rosenberg, R. S. Bradergroen, C. K. D. Breek,
P. H. M. Lommerse, and H. P. Spaink,
Computing with DNA by operating on plasmids.
BioSystems, Vol.57, 2000,
pp.870-93.
[Hyrup96BioMC]
B. Hyrup, and P. E. Nielsen.
Peptide Nucleic Acids (PNA):
Synthesis, Properties and Potential Applications.
Bioorganic \& Medical Chemistry, Vol.4, No.1, 1996,
pp.5--23.
[Lipton95Science]
R. J. Lipton.
DNA Solution of Hard Computational Problems.
Science, Vol.268, 1995,
pp.542--545.
[Liu00Nature]
Q. Liu, L. Wang, A.G. Frutos, A.E. Condon, R.M. Corn, and L.M. Smith.
DNA computing on surfaces.
Nature, Vol.403, 2000,
pp.175--179.
[Ouyang97Science]
Q. Ouyang, P. D. Kaplan, S. Liu and A. Libchaber.
DNA solution of the maximal clique problem.
Science, Vol.278, 1997,
pp.446--449.
[$B%j!<%I(B00$BF|7P%5%$%(%s%9(B]
M. A. $B%j!<%I(B, J. M.$B%D%"!<(B.
$BG.$rBS$S$kJ,;R%3%s%T%e!<%?!<3+H/(B,
$BF|7P%5%$%(%s%9(B, 10$B7n9f(B, 2000,
pp.52--61.
[Winfree98PhDThesis]
E. Winfree.
Algorithmic Self-Assembly of DNA.
Ph. D. Thesis, California Institute of Technology, May19, 1998.
[Winfree98Nature]
E. Winfree, F. Liu, L.A. Wenzler, and N.C. Seeman.
Design and self-assembly of two-dimensional DNA crystals.
Nature, Vol.394, 1998,
pp.539--544.
[Reif99DARPA]
John Reif.
DARPA Yearly Technical Report.
1999.
http://www.cs.duke.edu/~reif/BMC/reports/BMC.FY99.reports/BMC.DARPA.FY99.html
(Arita00GECCO.ps.gz 218k)
(Arita97GP.ps.gz 65k)
(Arita97ICEC.ps.gz 87k )
(Hagiya01KS.ps.gz 231k)
(Hagiya00MPS.ps.gz 109k)
(Hagiya01LNCS.ps.gz 658k)
(Hagiya00JSAI.ps.gz 213k)
(Hagiya99Fuzzy.ps.gz 117k)
(Hagiya99NGC.ps.gz 198k)
(Hagiya99DIMACS.ps.gz 118k)
(Hagiya98GP.ps.gz 96k)
(Hagiya97DNA.ps.gz 124k)
(Hagiya97JSAI.ps.gz 97k)
(Kobayashi00Multiset.ps.gz 66k)
(Kobayashi97ICEC.ps.gz 52k)
(Morimoto99DIMACS.ps.gz 176k)
(Nishikawa01SC.ps.gz 294k)
(Nishikawa00MPS.ps.gz 46k)
(Nishikawa00MPS-.ps.gz 263k)
abstract ,
full text
(Sakamoto99BioSystems.ps.gz 149k)
(Suyama97Micromachine.ps.gz 644k)
(Yokomori99DLT.ps.gz 135k)
(Yokomori99DNA.ps.gz 141k)
(Yokomori97DNA.ps.gz 73k)
(Yokomori97ICEC.ps.gz 63k)
$B9q:]3X2q!"9q:]%7%s%]%8%&%`Ey$N>7BT9V1i(B
$BFC5v(B
$B?7J9!&;(;o5-;v(B
$B%F%l%SJsF;(B
$B;29MJ88%(B
$BL\