Lusheng Wang
Orcid: 0000-0002-4344-8791Affiliations:
- City University of Hong Kong, Department of Computer Science
- McMaster University, Hamilton, Ontario, Canada (Ph.D., 1995)
According to our database1,
Lusheng Wang
authored at least 189 papers
between 1994 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on d-nb.info
On csauthors.net:
Bibliography
2024
IEEE ACM Trans. Comput. Biol. Bioinform., 2024
On the Existence of Parameterized Algorithms for the Shortest Common Supersequence and Related Problems.
Proceedings of the Algorithmic Aspects in Information and Management, 2024
2023
PPISB: A Novel Network-Based Algorithm of Predicting Protein-Protein Interactions With Mixed Membership Stochastic Blockmodel.
IEEE ACM Trans. Comput. Biol. Bioinform., 2023
Men Can't Always be Transformed into Mice: Decision Algorithms and Complexity for Sorting by Symmetric Reversals.
CoRR, 2023
Algorithms and Hardness for the Longest Common Subsequence of Three Strings and Related Problems.
Proceedings of the String Processing and Information Retrieval, 2023
Proceedings of the Bioinformatics Research and Applications - 19th International Symposium, 2023
Proceedings of the Frontiers of Algorithmics - 17th International Joint Conference, 2023
Cabbage Can't Always Be Transformed into Turnip: Decision Algorithms for Sorting by Symmetric Reversals.
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023
Proceedings of the Combinatorial Optimization and Applications, 2023
2022
J. Bioinform. Comput. Biol., 2022
2021
J. Comput. Syst. Sci., 2021
J. Comb. Optim., 2021
J. Comput. Biol., 2021
J. Comput. Biol., 2021
Proceedings of the Intelligent Computing Theories and Application, 2021
2020
Theor. Comput. Sci., 2020
IEEE ACM Trans. Comput. Biol. Bioinform., 2020
Improved Practical Algorithms for Rooted Subtree Prune and Regraft (rSPR) Distance and Hybridization Number.
J. Comput. Biol., 2020
mapAlign: An Efficient Approach for Mapping and Aligning Long Reads to Reference Genomes.
Proceedings of the Bioinformatics Research and Applications - 16th International Symposium, 2020
Proceedings of the Bioinformatics Research and Applications - 16th International Symposium, 2020
2019
Theor. Comput. Sci., 2019
Theor. Comput. Sci., 2019
Algorithmica, 2019
Proceedings of the 19th International Workshop on Algorithms in Bioinformatics, 2019
Proceedings of the Combinatorial Optimization and Applications, 2019
2018
Theor. Comput. Sci., 2018
IEEE ACM Trans. Comput. Biol. Bioinform., 2018
GRSR: a tool for deriving genome rearrangement scenarios from multiple unichromosomal genome sequences.
BMC Bioinform., 2018
Progressive approach for SNP calling and haplotype assembly using single molecular sequencing data.
Bioinform., 2018
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2018
2017
Predicting Protein Functions by Using Unbalanced Random Walk Algorithm on Three Biological Networks.
IEEE ACM Trans. Comput. Biol. Bioinform., 2017
IEEE ACM Trans. Comput. Biol. Bioinform., 2017
Knowl. Based Syst., 2017
Algorithmica, 2017
Proceedings of the Bioinformatics and Biomedical Engineering, 2017
Proceedings of the Bioinformatics Research and Applications - 13th International Symposium, 2017
2016
Core-genome scaffold comparison reveals the prevalence that inversion events are associated with pairs of inverted repeats.
CoRR, 2016
CoRR, 2016
Comput. Biol. Chem., 2016
Algorithmica, 2016
Proceedings of the Intelligent Computing Theories and Application, 2016
Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016
2015
A factor-(1.408 + ε) approximation for sorting unsigned genomes by reciprocal translocations.
Theor. Comput. Sci., 2015
Identification of Protein Complexes Using Weighted PageRank-Nibble Algorithm and Core-Attachment Structure.
IEEE ACM Trans. Comput. Biol. Bioinform., 2015
J. Comput. Biol., 2015
2014
Theor. Comput. Sci., 2014
IEEE ACM Trans. Comput. Biol. Bioinform., 2014
Probabilistic Models for Capturing More Physicochemical Properties on Protein-Protein Interface.
J. Chem. Inf. Model., 2014
A (1.408+ε)-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations.
Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014
Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014
Proceedings of the 2014 IEEE International Conference on Bioinformatics and Biomedicine, 2014
2013
IEEE ACM Trans. Comput. Biol. Bioinform., 2013
J. Comb. Optim., 2013
Detecting Protein Conformational Changes in Interactions via Scaling Known Structures.
J. Comput. Biol., 2013
Identifying protein complexes based on density and modularity in protein-protein interaction network.
BMC Syst. Biol., 2013
Bioinform., 2013
Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013
2012
IEEE ACM Trans. Comput. Biol. Bioinform., 2012
IEEE ACM Trans. Comput. Biol. Bioinform., 2012
IEEE ACM Trans. Comput. Biol. Bioinform., 2012
An improved approximation algorithm for the complementary maximal strip recovery problem.
J. Comput. Syst. Sci., 2012
A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring.
J. Comb. Optim., 2012
Exact and approximation algorithms for the complementary maximal strip recovery problem.
J. Comb. Optim., 2012
BMC Bioinform., 2012
Identifying mutation regions for closely related individuals without a known pedigree.
BMC Bioinform., 2012
Proceedings of the Bioinformatics Research and Applications - 8th International Symposium, 2012
Proceedings of the Combinatorial Optimization and Applications, 2012
2011
Fast Exact Algorithms for the Closest String and Substring Problems with Application to the Planted (L, d)-Motif Model.
IEEE ACM Trans. Comput. Biol. Bioinform., 2011
ACM Trans. Algorithms, 2011
J. Chem. Inf. Model., 2011
2010
Finding the Nearest Neighbors in Biological Databases Using Less Distance Computations.
IEEE ACM Trans. Comput. Biol. Bioinform., 2010
Modeling Protein Interacting Groups by Quasi-Bicliques: Complexity, Algorithm, and Application.
IEEE ACM Trans. Comput. Biol. Bioinform., 2010
Erratum to "An improved randomized approximation algorithm for maximum triangle packing" [Discrete Appl. Math. 157 (2009) 1640-1646]
Discret. Appl. Math., 2010
Randomized Approaches for Nearest Neighbor Search in Metric Space When Computing the Pairwise Distance Is Extremely Expensive.
Proceedings of the Algorithmic Aspects in Information and Management, 2010
Proceedings of the Algorithmic Aspects in Information and Management, 2010
2009
IEEE ACM Trans. Comput. Biol. Bioinform., 2009
SIAM J. Discret. Math., 2009
Discret. Appl. Math., 2009
Linked region detection using high-density SNP genotype data via the minimum recombinant model of pedigree haplotype inference.
BMC Bioinform., 2009
Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats.
Algorithmica, 2009
Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability.
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009
Efficient Algorithms for the Closest String and Distinguishing String Selection Problems.
Proceedings of the Frontiers in Algorithmics, Third International Workshop, 2009
2008
IEEE ACM Trans. Comput. Biol. Bioinform., 2008
J. Discrete Algorithms, 2008
An Efficient Voting Algorithm for Finding Additive Biclusters with Random Background.
J. Comput. Biol., 2008
Identification of linked regions using high-density SNP genotype data in linkage analysis.
Bioinform., 2008
Proceedings of the Theory and Applications of Models of Computation, 2008
Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008
An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem.
Proceedings of the Combinatorial Optimization and Applications, 2008
2007
Some approximation algorithms for the clique partition problem in weighted interval graphs.
Theor. Comput. Sci., 2007
J. Comput. Syst. Sci., 2007
J. Comput. Syst. Sci., 2007
Bioinform., 2007
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007
2006
IEEE Trans. Syst. Man Cybern. Syst., 2006
J. Glob. Optim., 2006
A polynomial time approximation scheme for embedding a directed hypergraph on a ring.
Inf. Process. Lett., 2006
Algorithms Mol. Biol., 2006
Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006
2005
J. Comput. Syst. Sci., 2005
Inf. Process. Lett., 2005
Proceedings of 3rd Asia-Pacific Bioinformatics Conference, 17-21 January 2005, Singapore, 2005
Proceedings of the Algorithmic Applications in Management, First International Conference, 2005
2004
IEEE Trans. Computers, 2004
Bioinform., 2004
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004
Proceedings of the Second Asia-Pacific Bioinformatics Conference (APBC 2004), 2004
2003
Solutions for Two Conjectures on the Inverse Problem of the Wiener Index of Peptoids.
SIAM J. Discret. Math., 2003
J. Comput. Biol., 2003
Bioinform., 2003
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003
2002
An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane.
Inf. Process. Lett., 2002
Proceedings of the Algorithms in Bioinformatics, Second International Workshop, 2002
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002
2001
Theor. Comput. Sci., 2001
The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001
2000
On the Inapproximability of Disjoint Paths and Minimum Steiner Forest with Bandwidth Constraints.
J. Comput. Syst. Sci., 2000
1999
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999
1998
Graph Traversals, Genes and Matroids: An Efficient Case of the Travelling Salesman Problem.
Discret. Appl. Math., 1998
Proceedings of the Mathematical Support for Molecular Biology, 1998
1997
1996
Algorithmica, 1996
1995
Proceedings of the Combinatorial Pattern Matching, 6th Annual Symposium, 1995
1994
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994