共 50 条
- [2] A DNA Computing Model on Triple-Stranded for Minimum Spanning Tree Problem BIO-INSPIRED COMPUTING - THEORIES AND APPLICATIONS, BIC-TA 2014, 2014, 472 : 549 - 551
- [3] The Minimum Spanning Tree Problem based on Triple-Stranded DNA Structure Model APPLIED MATHEMATICS & INFORMATION SCIENCES, 2014, 8 (01): : 351 - 354
- [4] DNA computing model for the minimum spanning tree problem SYNASC 2006: EIGHTH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING, PROCEEDINGS, 2007, : 372 - +
- [5] DNA computing model for the minimum spanning tree problem Proc. Int. Symp. Symb. Numer. Algorithms for Sci. Comput., SYNASC, (372-377):
- [7] Solving minimum spanning tree problem with DNA computing PROCEEDINGS OF 2002 INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE & ENGINEERING, VOLS I AND II, 2002, : 184 - 188
- [9] The Working Operation problem on Triple-stranded DNA Structure model PROCEEDINGS OF THE 2009 WRI GLOBAL CONGRESS ON INTELLIGENT SYSTEMS, VOL IV, 2009, : 295 - +
- [10] The postman problem based on Triple-stranded DNA Structure model ISBE 2011: 2011 INTERNATIONAL CONFERENCE ON BIOMEDICINE AND ENGINEERING, VOL 1, 2011, : 483 - 486