50 results on '"Zhu, Daming"'
Search Results
2. Analysis and Experimental Verification on Spiral EMAT Radiation Sound Field Analysis Based on Green’s Function Method
3. Study on the Influence of Spiral EMAT Radiation Sound Field on Defect Detection by FEM
4. SVLR: Genome Structure Variant Detection Using Long Read Sequencing Data
5. Maximum Stacking Base Pairs: Hardness and Approximation by Nonlinear LP-Rounding
6. An Approximation Algorithm for Sorting by Bounded Singleton Moves
7. PASA: Identifying More Credible Structural Variants of Hedou12
8. DTAST: A Novel Radical Framework for de Novo Transcriptome Assembly Based on Suffix Trees
9. Effect of Working Pressure on the Structural and Thermoelectric Properties of Bismuth Telluride Thin Films Deposited by Magnetron Sputtering
10. Improved Indel Detection Algorithm Based on Split-Read and Read-Depth
11. A New Approximation Algorithm for the Maximum Stacking Base Pairs Problem from RNA Secondary Structures Prediction
12. A 1.4-Approximation Algorithm for Two-Sided Scaffold Filling
13. IsoTree: De Novo Transcriptome Assembly from RNA-Seq Reads
14. Determination of Protein Content in Alhydrogel®-Based Vaccines by O-Phthalaldehyde Assay
15. A New Approximation Algorithm for Unsigned Translocation Sorting
16. A New Algorithm for Intermediate Dataset Storage in a Cloud-Based Dataflow
17. Approximation and Nonapproximability for the One-Sided Scaffold Filling Problem
18. Local Search to Approximate Max NAE-$$k$$-Sat Tightly
19. Approximating the Maximum Internal Spanning Tree Problem via a Maximum Path-Cycle Cover
20. An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves
21. A (1.408+ε)-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations
22. An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies
23. The Algorithm for the Two-Sided Scaffold Filling Problem
24. On Editing Graphs into 2-Club Clusters
25. Algorithms with Restrictive Input Constrains on Genome Exemplar Distance Caculation
26. Tight Bounds on Local Search to Approximate the Maximum Satisfiability Problems
27. Monitoring of Subclinical Atherosclerotic Disease
28. Minimum Common String Partition Revisited
29. Polynomial-Time Algorithm for Sorting by Generalized Translocations
30. DNA Encoding Methods in the Field of DNA Computing
31. Prediction of Protein Subcellular Locations by Combining K-Local Hyperplane Distance Nearest Neighbor
32. Algorithms for the Well-Drilling Layout Problem
33. A New DNA-Based Approach to Solve the Maximum Weight Clique Problem
34. Faster Algorithms for Sorting by Transpositions and Sorting by Block-Interchanges
35. A New DNA Encoding Method for Traveling Salesman Problem
36. A 1.75-Approximation Algorithm for Unsigned Translocation Distance
37. A New Pseudoknots Folding Algorithm for RNA Structure Prediction
38. A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations
39. Determining Residual Host Cell Antigen Levels in Purified Recombinant Proteins by Slot Blot and Scanning Laser Densitometry
40. Genome Rearrangement Algorithms for Unsigned Permutations with O(logn) Singletons
41. Local Search to Approximate Max NAE- -Sat Tightly.
42. A New Algorithm for Intermediate Dataset Storage in a Cloud-Based Dataflow.
43. A (1.408+ε)-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations.
44. An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves.
45. Approximating the Maximum Internal Spanning Tree Problem via a Maximum Path-Cycle Cover.
46. On Editing Graphs into 2-Club Clusters.
47. Minimum Common String Partition Revisited.
48. A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations.
49. Genome Rearrangement Algorithms for Unsigned Permutations with O(logn) Singletons.
50. A New Pseudoknots Folding Algorithm for RNA Structure Prediction.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.