122 results on '"Zhu, Daming"'
Search Results
2. SVLR: Genome Structure Variant Detection Using Long Read Sequencing Data
3. An Approximation Algorithm for Sorting by Bounded Singleton Moves
4. Maximum Stacking Base Pairs: Hardness and Approximation by Nonlinear LP-Rounding
5. Improved Indel Detection Algorithm Based on Split-Read and Read-Depth
6. DTAST: A Novel Radical Framework for de Novo Transcriptome Assembly Based on Suffix Trees
7. PASA: Identifying More Credible Structural Variants of Hedou12
8. SVLR: Genome Structure Variant Detection Using Long Read Sequencing Data
9. A New Approximation Algorithm for the Maximum Stacking Base Pairs Problem from RNA Secondary Structures Prediction
10. A 1.4-Approximation Algorithm for Two-Sided Scaffold Filling
11. IsoTree: De Novo Transcriptome Assembly from RNA-Seq Reads : (Extended Abstract)
12. A New Approximation Algorithm for Unsigned Translocation Sorting
13. Maximum Stacking Base Pairs: Hardness and Approximation by Nonlinear LP-Rounding
14. Approximation and Nonapproximability for the One-Sided Scaffold Filling Problem
15. A New Algorithm for Intermediate Dataset Storage in a Cloud-Based Dataflow
16. Local Search to Approximate Max NAE--Sat Tightly
17. Approximating the Maximum Internal Spanning Tree Problem via a Maximum Path-Cycle Cover
18. An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves
19. A (1.408+ε)-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations
20. PASA: Identifying More Credible Structural Variants of Hedou12
21. DTAST: A Novel Radical Framework for de Novo Transcriptome Assembly Based on Suffix Trees
22. Improved Indel Detection Algorithm Based on Split-Read and Read-Depth
23. A New Approximation Algorithm for the Maximum Stacking Base Pairs Problem from RNA Secondary Structures Prediction
24. A 1.4-Approximation Algorithm for Two-Sided Scaffold Filling
25. IsoTree: De Novo Transcriptome Assembly from RNA-Seq Reads
26. A New Algorithm for Intermediate Dataset Storage in a Cloud-Based Dataflow
27. Local Search to Approximate Max NAE-$$k$$-Sat Tightly
28. Approximating the Maximum Internal Spanning Tree Problem via a Maximum Path-Cycle Cover
29. An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves
30. A (1.408+ε)-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations
31. Fine-Grained Parameterized Complexity Analysis of Knot-Free Vertex Deletion – A Deadlock Resolution Graph Problem
32. More Routes for Evacuation
33. Approximating Global Optimum for Probabilistic Truth Discovery
34. Constant Factor Approximation Algorithm for l-Pseudoforest Deletion Problem
35. New Bounds for Energy Complexity of Boolean Functions
36. Hitting and Covering Partially
37. Contextual Dependent Click Bandit Algorithm for Web Recommendation
38. Approximation Algorithms for a Two-Phase Knapsack Problem
39. Heuristic Algorithms for the Min-Max Edge 2-Coloring Problem
40. SDP Primal-Dual Approximation Algorithms for Directed Hypergraph Expansion and Sparsest Cut with Product Demands
41. Non-determinism Reduces Construction Time in Active Self-assembly Using an Insertion Primitive
42. A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time
43. On a Fixed Haplotype Variant of the Minimum Error Correction Problem
44. Geometric Spanners in the MapReduce Model
45. Amplitude Amplification for Operator Identification and Randomized Classes
46. LP-Based Pivoting Algorithm for Higher-Order Correlation Clustering
47. Minimum Transactions Problem
48. Approximation Algorithms on Multiple Two-Stage Flowshops
49. Minimum Membership Hitting Sets of Axis Parallel Segments
50. Lower Bounds for Special Cases of Syntactic Multilinear ABPs
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.