28 results on '"Zhu, Daming"'
Search Results
2. The Algorithm for the Two-Sided Scaffold Filling Problem
3. Algorithms with Restrictive Input Constrains on Genome Exemplar Distance Caculation
4. On Editing Graphs into 2-Club Clusters
5. Tight Bounds on Local Search to Approximate the Maximum Satisfiability Problems
6. Minimum Common String Partition Revisited
7. Polynomial-Time Algorithm for Sorting by Generalized Translocations
8. DNA Encoding Methods in the Field of DNA Computing
9. A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations
10. Genome Rearrangement Algorithms for Unsigned Permutations with O(logn) Singletons
11. Algorithms for the Well-Drilling Layout Problem
12. Prediction of Protein Subcellular Locations by Combining K-Local Hyperplane Distance Nearest Neighbor
13. A New DNA-Based Approach to Solve the Maximum Weight Clique Problem
14. A New DNA Encoding Method for Traveling Salesman Problem
15. Faster Algorithms for Sorting by Transpositions and Sorting by Block-Interchanges
16. Direct Growth of Graphene on Silicon by Metal-Free Chemical Vapor Deposition
17. A 1.75-Approximation Algorithm for Unsigned Translocation Distance
18. A New Pseudoknots Folding Algorithm for RNA Structure Prediction
19. On Editing Graphs into 2-Club Clusters
20. Minimum Common String Partition Revisited
21. DNA Encoding Methods in the Field of DNA Computing
22. Prediction of Protein Subcellular Locations by Combining K-Local Hyperplane Distance Nearest Neighbor
23. Algorithms for the Well-Drilling Layout Problem
24. A New DNA-Based Approach to Solve the Maximum Weight Clique Problem
25. A New DNA Encoding Method for Traveling Salesman Problem
26. A 1.75-Approximation Algorithm for Unsigned Translocation Distance
27. A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations
28. Genome Rearrangement Algorithms for Unsigned Permutations with O(logn) Singletons
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.