Lusheng Wang

Orcid: 0000-0002-4344-8791

Affiliations:
  • 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 171 papers between 1995 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Flanked Block-Interchange Distance on Strings.
IEEE ACM Trans. Comput. Biol. Bioinform., 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

On Sorting by Flanked Transpositions.
Proceedings of the Bioinformatics Research and Applications - 19th International Symposium, 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

2022
Identifying duplications and lateral gene transfers simultaneously and rapidly.
J. Bioinform. Comput. Biol., 2022

mzMD: visualization-oriented MS data storage and retrieval.
Bioinform., 2022

2021
A 43-approximation algorithm for the Maximum Internal Spanning Tree Problem.
J. Comput. Syst. Sci., 2021

A randomized approximation algorithm for metric triangle packing.
J. Comb. Optim., 2021

Fast and Accurate Algorithms for Mapping and Aligning Long Reads.
J. Comput. Biol., 2021

SVLR: Genome Structural Variant Detection Using Long-Read Sequencing Data.
J. Comput. Biol., 2021

mzMD: A New Storage and Retrieval System for Mass Spectrometry Data.
Proceedings of the Intelligent Computing Theories and Application, 2021

2020
The one-cop-moves game on graphs with some special structures.
Theor. Comput. Sci., 2020

Faster Exact Computation of rSPR Distance via Better Approximation.
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

Computing a Consensus Phylogeny via Leaf Removal.
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

SVLR: Genome Structure Variant Detection Using Long Read Sequencing Data.
Proceedings of the Bioinformatics Research and Applications - 16th International Symposium, 2020

2019
Designing and implementing algorithms for the closest string problem.
Theor. Comput. Sci., 2019

Positive semidefinite zero forcing numbers of two classes of graphs.
Theor. Comput. Sci., 2019

Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem.
Algorithmica, 2019

Better Practical Algorithms for rSPR Distance and Hybridization Number.
Proceedings of the 19th International Workshop on Algorithms in Bioinformatics, 2019

The One-Cop-Moves Game on Graphs of Small Treewidth.
Proceedings of the Combinatorial Optimization and Applications, 2019

2018
Approximation algorithms for the scaffolding problem and its generalizations.
Theor. Comput. Sci., 2018

Guest Editorial for the 15th Asia Pacific Bioinformatics Conference.
IEEE ACM Trans. Comput. Biol. Bioinform., 2018

Algorithms for Pedigree Comparison.
IEEE ACM Trans. Comput. Biol. Bioinform., 2018

An approximation algorithm for maximum internal spanning tree.
J. Comb. Optim., 2018

GRSR: a tool for deriving genome rearrangement scenarios from multiple unichromosomal genome sequences.
BMC Bioinform., 2018

Better ILP models for haplotype assembly.
BMC Bioinform., 2018

Progressive approach for SNP calling and haplotype assembly using single molecular sequencing data.
Bioinform., 2018

Finding a Center Tree of Phylogenetic Trees via Leaf Removal.
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

Exploring Consensus RNA Substructural Patterns Using Subgraph Mining.
IEEE ACM Trans. Comput. Biol. Bioinform., 2017

Using propensity scores to predict the kinases of unannotated phosphopeptides.
Knowl. Based Syst., 2017

A Polynomial Time Approximation Scheme for the Closest Shared Center Problem.
Algorithmica, 2017

Comprehensive Study of Instable Regions in Pseudomonas Aeruginosa.
Proceedings of the Bioinformatics and Biomedical Engineering, 2017

A New 2-Approximation Algorithm for rSPR Distance.
Proceedings of the Bioinformatics Research and Applications - 13th International Symposium, 2017

2016
Closest String and Substring Problems.
Encyclopedia of Algorithms, 2016

Better ILP-Based Approaches to Haplotype Assembly.
J. Comput. Biol., 2016

Core-genome scaffold comparison reveals the prevalence that inversion events are associated with pairs of inverted repeats.
CoRR, 2016

A Cubic-Time 2-Approximation Algorithm for rSPR Distance.
CoRR, 2016

Approximation algorithms for the maximum weight internal spanning tree problem.
CoRR, 2016

An Approximation Algorithm for Maximum Internal Spanning Tree.
CoRR, 2016

Protein-protein interface prediction based on hexagon structure similarity.
Comput. Biol. Chem., 2016

Randomized Fixed-Parameter Algorithms for the Closest String Problem.
Algorithmica, 2016

Depth-First Search Encoding of RNA Substructures.
Proceedings of the Intelligent Computing Theories and Application, 2016

Better Approximation Algorithms for Scaffolding Problems.
Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

An Improved Approximation Algorithm for rSPR Distance.
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

Faster exact computation of rSPR distance.
J. Comb. Optim., 2015

A Dynamic Programming Algorithm For (1, 2)-Exemplar Breakpoint Distance.
J. Comput. Biol., 2015

An efficient algorithm for the blocked pattern matching problem.
Bioinform., 2015

2014
Parameterized and approximation algorithms for finding two disjoint matchings.
Theor. Comput. Sci., 2014

Quantifying Significance of MHC II Residues.
IEEE ACM Trans. Comput. Biol. Bioinform., 2014

Probabilistic Models for Capturing More Physicochemical Properties on Protein-Protein Interface.
J. Chem. Inf. Model., 2014

The Parameterized Complexity of the Shared Center Problem.
Algorithmica, 2014

A (1.408+ε)-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations.
Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014

Randomized and Parameterized Algorithms for the Closest String Problem.
Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

A parameterized algorithm for (1, 2)-exemplar breakpoint distance.
Proceedings of the 2014 IEEE International Conference on Bioinformatics and Biomedicine, 2014

2013
An Exact Algorithm for the Zero Exemplar Breakpoint Distance Problem.
IEEE ACM Trans. Comput. Biol. Bioinform., 2013

Near optimal solutions for maximum quasi-bicliques.
J. Comb. Optim., 2013

Constant time approximation scheme for largest well predicted subset.
J. Comb. Optim., 2013

Detecting Protein Conformational Changes in Interactions via Scaling Known Structures.
J. Comput. Biol., 2013

An Ultrafast Tool for Minimum Reticulate Networks.
J. Comput. Biol., 2013

An approximation algorithm for the Bandpass-2 problem.
CoRR, 2013

Identifying protein complexes based on density and modularity in protein-protein interaction network.
BMC Syst. Biol., 2013

Exact algorithms for haplotype assembly from whole-genome sequence data.
Bioinform., 2013

Faster Exact Computation of rSPR Distance.
Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2012
Mutation Region Detection for Closely Related Individuals without a Known Pedigree.
IEEE ACM Trans. Comput. Biol. Bioinform., 2012

Algorithms for Reticulate Networks of Multiple Phylogenetic Trees.
IEEE ACM Trans. Comput. Biol. Bioinform., 2012

Simultaneous Identification of Duplications, Losses, and Lateral Gene Transfers.
IEEE ACM Trans. Comput. Biol. Bioinform., 2012

An improved approximation algorithm for the complementary maximal strip recovery problem.
J. Comput. Syst. Sci., 2012

A three-string approach to the closest string 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

Computing the protein binding sites.
BMC Bioinform., 2012

Protein-protein binding site identification by enumerating the configurations.
BMC Bioinform., 2012

Identifying mutation regions for closely related individuals without a known pedigree.
BMC Bioinform., 2012

A fast tool for minimum hybridization networks.
BMC Bioinform., 2012

P-Binder: A System for the Protein-Protein Binding Sites Identification.
Proceedings of the Bioinformatics Research and Applications - 8th International Symposium, 2012

An Improved Approximation Algorithm for the Bandpass-2 Problem.
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

Discovering almost any hidden motif from multiple sequences.
ACM Trans. Algorithms, 2011

Protein-Protein Binding Sites Prediction by 3D Structural Similarities.
J. Chem. Inf. Model., 2011

An Approximation Algorithm for the Minimum Co-Path Set Problem.
Algorithmica, 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

Beyond evolutionary trees.
Nat. Comput., 2010

On the Tractability of Maximal Strip Recovery.
J. Comput. Biol., 2010

Identification of Distinguishing Motifs.
Int. J. Knowl. Discov. Bioinform., 2010

Erratum to "An improved randomized approximation algorithm for maximum triangle packing" [Discrete Appl. Math. 157 (2009) 1640-1646]
Discret. Appl. Math., 2010

HybridNET: a tool for constructing hybridization networks.
Bioinform., 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

A Linear Kernel for Co-Path/Cycle Packing.
Proceedings of the Algorithmic Aspects in Information and Management, 2010

2009
Improved Approximation Algorithms for Reconstructing the History of Tandem Repeats.
IEEE ACM Trans. Comput. Biol. Bioinform., 2009

Probabilistic Analysis of a Motif Discovery Algorithm for Multiple Sequences.
SIAM J. Discret. Math., 2009

On bipartite graphs with minimal energy.
Discret. Appl. Math., 2009

An improved randomized approximation algorithm for maximum triangle packing.
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
Relay sensor placement in wireless sensor networks.
Wirel. Networks, 2008

A (1.5 + epsilon)-Approximation Algorithm for Unsigned Translocation Distance.
IEEE ACM Trans. Comput. Biol. Bioinform., 2008

Approximation Algorithms for Biclustering Problems.
SIAM J. Comput., 2008

An improved approximation algorithm for maximum edge 2-coloring in simple graphs.
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

Space Efficient Algorithms for Ordered Tree Comparison.
Algorithmica, 2008

Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences.
Proceedings of the Theory and Applications of Models of Computation, 2008

Finding Additive Biclusters with Random Background.
Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

Quasi-bicliques: Complexity and Binding Pairs.
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

Near optimal multiple alignment within a band in polynomial time.
J. Comput. Syst. Sci., 2007

A 1.75-approximation algorithm for unsigned translocation distance.
J. Comput. Syst. Sci., 2007

On packing and coloring hyperedges in a cycle.
Discret. Appl. Math., 2007

Computing the maximum similarity bi-clusters of gene expression data.
Bioinform., 2007

Foreword.
Algorithmica, 2007

Identification of Distinguishing Motifs.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2006
Algorithmic approaches for genome rearrangement: a review.
IEEE Trans. Syst. Man Cybern. Syst., 2006

On the complexity of unsigned translocation distance.
Theor. Comput. Sci., 2006

Optimal Relay Location for Resource-limited Energy-efficient Wireless Communication.
J. Glob. Optim., 2006

Introduction to the special issue.
J. Comb. Optim., 2006

A polynomial time approximation scheme for embedding a directed hypergraph on a ring.
Inf. Process. Lett., 2006

Finding the region of pseudo-periodic tandem repeats in biological sequences.
Algorithms Mol. Biol., 2006

Translocation Distance: Algorithms and Complexity.
Adv. Comput., 2006

Approximation Algorithms for Bi-clustering Problems.
Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006

2005
Exact matching of RNA secondary structure patterns.
Theor. Comput. Sci., 2005

On the complexity of finding emerging patterns.
Theor. Comput. Sci., 2005

An <i>O</i>(<i>n</i><sup>2</sup>) algorithm for signed translocation.
J. Comput. Syst. Sci., 2005

Maximizing Profits of Routing in WDM Networks.
J. Comb. Optim., 2005

An Improved Randomized Approximation Algorithm for Max TSP.
J. Comb. Optim., 2005

Randomized Algorithms for Motif Detection.
J. Bioinform. Comput. Biol., 2005

Improved deterministic approximation algorithms for Max TSP.
Inf. Process. Lett., 2005

Decomposing toroidal graphs into circuits and edges.
Discret. Appl. Math., 2005

An O(N<sup>2</sup>) algorithm for signed translocation problem.
Proceedings of 3rd Asia-Pacific Bioinformatics Conference, 17-21 January 2005, Singapore, 2005

An Approximation Algorithm for Embedding a Directed Hypergraph on a Ring.
Proceedings of the Algorithmic Applications in Management, First International Conference, 2005

2004
Topology Control of Ad Hoc Wireless Networks for Energy Efficiency.
IEEE Trans. Computers, 2004

Removable edges in a cycle of a 4-connected graph.
Discret. Math., 2004

CTRD: a fast applet for computing signed translocation distance between genomes.
Bioinform., 2004

Minimum k Arborescences with Bandwidth Constraints.
Algorithmica, 2004

Randomized Algorithms for Motif Detection.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Exact Pattern Matching for RNA Secondary Structures.
Proceedings of the Second Asia-Pacific Bioinformatics Conference (APBC 2004), 2004

2003
Approximate sequencing for variable length tasks.
Theor. Comput. Sci., 2003

Solutions for Two Conjectures on the Inverse Problem of the Wiener Index of Peptoids.
SIAM J. Discret. Math., 2003

Genetic Design of Drugs Without Side-Effects.
SIAM J. Comput., 2003

The Inverse Problems for Some Topological Indices in Combinatorial Chemistry.
J. Comput. Biol., 2003

Greedy method for inferring tandem duplication history.
Bioinform., 2003

Parametric alignment of ordered trees.
Bioinform., 2003

Haplotype inference by maximum parsimony.
Bioinform., 2003

SEGID: Identifying Interesting Segments in (Multiple) Sequence Alignments.
Bioinform., 2003

2002
Computing similarity between RNA structures.
Theor. Comput. Sci., 2002

Finding Similar Regions in Many Sequences.
J. Comput. Syst. Sci., 2002

Center and Distinguisher for Strings with Unbounded Alphabet.
J. Comb. Optim., 2002

On the closest string and substring problems.
J. ACM, 2002

An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane.
Inf. Process. Lett., 2002

Efficient Methods for Inferring Tandem Duplication History.
Proceedings of the Algorithms in Bioinformatics, Second International Workshop, 2002

A PTAS for Distinguishing (Sub)string Selection.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001
Approximations for Steiner trees with minimum number of Steiner points.
Theor. Comput. Sci., 2001

Perfect Phylogenetic Networks with Recombination.
J. Comput. Biol., 2001

2000
A More Efficient Approximation Scheme for Tree Alignment.
SIAM J. Comput., 2000

On the Inapproximability of Disjoint Paths and Minimum Steiner Forest with Bandwidth Constraints.
J. Comput. Syst. Sci., 2000

Fixed topology alignment with recombination.
Discret. Appl. Math., 2000

1999
Fitting Distances by Tree Metrics with Increment Error.
J. Comb. Optim., 1999

Finding Similar Regions in Many Strings.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

1996
On the Complexity of Comparing Evolutionary Trees.
Discret. Appl. Math., 1996

1995
Alignment of Trees - An Alternative to Tree Edit.
Theor. Comput. Sci., 1995

On the Complexity of Comparing Evolutionary Trees (Extended Abstract).
Proceedings of the Combinatorial Pattern Matching, 6th Annual Symposium, 1995


  Loading...