The following pages link to Lusheng Wang (Q166206):
Displayed 50 items.
- Faster exact computation of rSPR distance (Q2343983) (← links)
- Constant time approximation scheme for largest well predicted subset (Q2377379) (← links)
- Near optimal solutions for maximum quasi-bicliques (Q2377385) (← links)
- On packing and coloring hyperedges in a cycle (Q2384398) (← links)
- Optimal relay location for resource-limited energy-efficient wireless communication (Q2433926) (← links)
- Decomposing toroidal graphs into circuits and edges (Q2486748) (← links)
- An improved randomized approximation algorithm for Max TSP (Q2576776) (← links)
- Approximation algorithms for the scaffolding problem and its generalizations (Q2636507) (← links)
- A 1.75-approximation algorithm for unsigned translocation distance (Q2643729) (← links)
- A \(\frac{4}{3}\)-approximation algorithm for the maximum internal spanning tree problem (Q2656175) (← links)
- Fast searching on cactus graphs (Q2696935) (← links)
- Aligning sequences via an evolutionary tree (Q2817672) (← links)
- An Improved Approximation Algorithm for rSPR Distance (Q2817889) (← links)
- Finding similar regions in many strings (Q2819580) (← links)
- (Q2856760) (← links)
- Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings (Q2867103) (← links)
- The Parameterized Complexity of the Shared Center Problem (Q2904516) (← links)
- An Improved Approximation Algorithm for the Complementary Maximal Strip Recovery Problem (Q3004655) (← links)
- (Q3024817) (← links)
- Probabilistic Analysis of a Motif Discovery Algorithm for Multiple Sequences (Q3058527) (← links)
- On Constrained Minimum Pseudotriangulations (Q3082951) (← links)
- (Q3144357) (← links)
- An Improved Approximation Algorithm for the Bandpass-2 Problem (Q3167361) (← links)
- A (1.408+ε)-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations (Q3188842) (← links)
- Discovering almost any hidden motif from multiple sequences (Q3189008) (← links)
- On the closest string and substring problems (Q3196639) (← links)
- Approximation Algorithms for Biclustering Problems (Q3395042) (← links)
- Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences (Q3502650) (← links)
- Identification of Distinguishing Motifs (Q3506927) (← links)
- Finding Additive Biclusters with Random Background (Q3506959) (← links)
- Quasi-bicliques: Complexity and Binding Pairs (Q3511335) (← links)
- An Improved Randomized Approximation Algorithm for Maximum Triangle Packing (Q3511419) (← links)
- Near Optimal Solutions for Maximum Quasi-bicliques (Q3578341) (← links)
- Constant Time Approximation Scheme for Largest Well Predicted Subset (Q3578343) (← links)
- A Three-String Approach to the Closest String Problem (Q3578345) (← links)
- A Linear Kernel for Co-Path/Cycle Packing (Q3578360) (← links)
- Randomized Approaches for Nearest Neighbor Search in Metric Space When Computing the Pairwise Distance Is Extremely Expensive (Q3578379) (← links)
- Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats (Q3608873) (← links)
- Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability (Q3630208) (← links)
- On the Tractability of Maximal Strip Recovery (Q3630225) (← links)
- (Q4246778) (← links)
- (Q4247446) (← links)
- An approximation scheme for some Steiner tree problems in the plane (Q4344454) (← links)
- Improved Approximation Algorithms for Tree Alignment (Q4373002) (← links)
- (Q4410119) (← links)
- Genetic Design of Drugs Without Side-Effects (Q4429675) (← links)
- Solutions for Two Conjectures on the Inverse Problem of the Wiener Index of Peptoids (Q4443132) (← links)
- A More Efficient Approximation Scheme for Tree Alignment (Q4507349) (← links)
- (Q4525729) (← links)
- (Q4551389) (← links)