Search

Your search keyword '"Zhu, Daming"' showing total 130 results

Search Constraints

Start Over You searched for: Author "Zhu, Daming" Remove constraint Author: "Zhu, Daming" Publication Type eBooks Remove constraint Publication Type: eBooks
130 results on '"Zhu, Daming"'

Search Results

1. FOKHic: A Framework of -mer Based Hierarchical Classification

2. Cabbage Can’t Always Be Transformed into Turnip: Decision Algorithms for Sorting by Symmetric Reversals

3. On Sorting by Flanked Transpositions

4. Study on the Influence of Spiral EMAT Radiation Sound Field on Defect Detection by FEM

5. Analysis and Experimental Verification on Spiral EMAT Radiation Sound Field Analysis Based on Green’s Function Method

6. mzMD: A New Storage and Retrieval System for Mass Spectrometry Data

7. SVLR: Genome Structure Variant Detection Using Long Read Sequencing Data

8. An Approximation Algorithm for Sorting by Bounded Singleton Moves

9. Maximum Stacking Base Pairs: Hardness and Approximation by Nonlinear LP-Rounding

11. Improved Indel Detection Algorithm Based on Split-Read and Read-Depth

12. DTAST: A Novel Radical Framework for de Novo Transcriptome Assembly Based on Suffix Trees

13. PASA: Identifying More Credible Structural Variants of Hedou12

14. A New Approximation Algorithm for the Maximum Stacking Base Pairs Problem from RNA Secondary Structures Prediction

15. A 1.4-Approximation Algorithm for Two-Sided Scaffold Filling

16. IsoTree: De Novo Transcriptome Assembly from RNA-Seq Reads : (Extended Abstract)

17. A New Approximation Algorithm for Unsigned Translocation Sorting

18. Approximation and Nonapproximability for the One-Sided Scaffold Filling Problem

19. A New Algorithm for Intermediate Dataset Storage in a Cloud-Based Dataflow

20. Local Search to Approximate Max NAE--Sat Tightly

21. Approximating the Maximum Internal Spanning Tree Problem via a Maximum Path-Cycle Cover

22. An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves

23. A (1.408+ε)-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations

24. An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies

25. The Algorithm for the Two-Sided Scaffold Filling Problem

27. On Editing Graphs into 2-Club Clusters

29. Tight Bounds on Local Search to Approximate the Maximum Satisfiability Problems

30. Minimum Common String Partition Revisited

31. Polynomial-Time Algorithm for Sorting by Generalized Translocations

33. A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations

34. Genome Rearrangement Algorithms for Unsigned Permutations with O(logn) Singletons

36. Prediction of Protein Subcellular Locations by Combining K-Local Hyperplane Distance Nearest Neighbor

37. A New DNA-Based Approach to Solve the Maximum Weight Clique Problem

38. A New DNA Encoding Method for Traveling Salesman Problem

39. Faster Algorithms for Sorting by Transpositions and Sorting by Block-Interchanges

40. A 1.75-Approximation Algorithm for Unsigned Translocation Distance

42. Fine-Grained Parameterized Complexity Analysis of Knot-Free Vertex Deletion – A Deadlock Resolution Graph Problem

43. More Routes for Evacuation

44. Approximating Global Optimum for Probabilistic Truth Discovery

45. Constant Factor Approximation Algorithm for l-Pseudoforest Deletion Problem

46. New Bounds for Energy Complexity of Boolean Functions

47. Hitting and Covering Partially

48. Contextual Dependent Click Bandit Algorithm for Web Recommendation

49. Approximation Algorithms for a Two-Phase Knapsack Problem

50. Heuristic Algorithms for the Min-Max Edge 2-Coloring Problem

Catalog

Books, media, physical & digital resources