| 2008 |
| 23 | EE | Xiaowen Lou,
Daming Zhu:
A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations.
COCOON 2008: 331-341 |
| 22 | EE | Xiaowen Lou,
Daming Zhu:
Genome Rearrangement Algorithms for Unsigned Permutations with O(logn) Singletons.
TAMC 2008: 59-69 |
| 21 | EE | Aili Han,
Daming Zhu:
DNA Encoding Methods in the Field of DNA Computing.
Computational Intelligence in Bioinformatics 2008: 293-322 |
| 20 | EE | Guohui Yao,
Daming Zhu,
Hengwu Li,
Shaohan Ma:
A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem.
Discrete Mathematics 308(17): 3951-3959 (2008) |
| 19 | EE | Yun Cui,
Lusheng Wang,
Daming Zhu,
Xiaowen Liu:
A (1.5 + epsilon)-Approximation Algorithm for Unsigned Translocation Distance.
IEEE/ACM Trans. Comput. Biology Bioinform. 5(1): 56-66 (2008) |
| 18 | EE | Aili Han,
Daming Zhu,
Jingchang Pan:
DNA solution based on sequence alignment to the Minimum Spanning Tree problem.
IJBRA 4(2): 188-200 (2008) |
| 2007 |
| 17 | EE | Hong Liu,
Haodi Feng,
Daming Zhu:
Prediction of Protein Subcellular Locations by Combining K-Local Hyperplane Distance Nearest Neighbor.
ADMA 2007: 345-351 |
| 16 | EE | Aili Han,
Daming Zhu,
Shouqiang Wang,
Meixia Qu:
Algorithms for the Well-Drilling Layout Problem.
ICIC (2) 2007: 263-271 |
| 15 | EE | Jianxing Feng,
Daming Zhu:
Faster algorithms for sorting by transpositions and sorting by block interchanges.
ACM Transactions on Algorithms 3(3): (2007) |
| 14 | EE | Yun Cui,
Lusheng Wang,
Daming Zhu:
A 1.75-approximation algorithm for unsigned translocation distance.
J. Comput. Syst. Sci. 73(7): 1045-1059 (2007) |
| 2006 |
| 13 | EE | Aili Han,
Daming Zhu:
A New DNA-Based Approach to Solve the Maximum Weight Clique Problem.
ICIC (3) 2006: 320-327 |
| 12 | EE | Aili Han,
Daming Zhu:
A New DNA Encoding Method for Traveling Salesman Problem.
ICIC (3) 2006: 328-335 |
| 11 | EE | Aili Han,
Daming Zhu:
Complexity Analysis for the HEWN Algorithm.
ISDA (1) 2006: 1015-1019 |
| 10 | EE | Aili Han,
Daming Zhu:
DNA Computing Model for the Minimum Spanning Tree Problem.
SYNASC 2006: 372-377 |
| 9 | EE | Jianxing Feng,
Daming Zhu:
Faster Algorithms for Sorting by Transpositions and Sorting by Block-Interchanges.
TAMC 2006: 128-137 |
| 8 | EE | Daming Zhu,
Lusheng Wang:
On the complexity of unsigned translocation distance.
Theor. Comput. Sci. 352(1-3): 322-328 (2006) |
| 2005 |
| 7 | EE | Lusheng Wang,
Daming Zhu,
Xiaowen Liu,
Shaohan Ma:
An O(N2) algorithm for signed translocation problem.
APBC 2005: 349-358 |
| 6 | EE | Hengwu Li,
Daming Zhu:
A New Pseudoknots Folding Algorithm for RNA Structure Prediction.
COCOON 2005: 94-103 |
| 5 | EE | Yun Cui,
Lusheng Wang,
Daming Zhu:
A 1.75-Approximation Algorithm for Unsigned Translocation Distance.
ISAAC 2005: 392-401 |
| 4 | EE | Lusheng Wang,
Daming Zhu,
Xiaowen Liu,
Shaohan Ma:
An O(n2) algorithm for signed translocation.
J. Comput. Syst. Sci. 70(3): 284-299 (2005) |
| 2004 |
| 3 | EE | WangSen Feng,
Lusheng Wang,
Daming Zhu:
CTRD: a fast applet for computing signed translocation distance between genomes.
Bioinformatics 20(17): 3256-3257 (2004) |
| 2001 |
| 2 | EE | Daming Zhu,
Junfeng Luan,
Shaohan Ma:
Hardness and Methods to Solve CLIQUE.
J. Comput. Sci. Technol. 16(4): 388- (2001) |
| 1994 |
| 1 | | Daming Zhu,
Shaohan Ma,
Hongze Qiu:
Analysis of the Convergency of Topology Preserving Neural Networks on Learning.
ISAAC 1994: 128-136 |