Lusheng Wang

According to our database1, Lusheng Wang
  • authored at least 217 papers between 1992 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Predicting Protein Functions by Using Unbalanced Random Walk Algorithm on Three Biological Networks.
IEEE/ACM Trans. Comput. Biology Bioinform., 2017

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

Efficient Graph-Based Resource Allocation Scheme Using Maximal Independent Set for Randomly- Deployed Small Star Networks.
Sensors, 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

An Approximation Algorithm for Maximum Internal Spanning Tree.
Proceedings of the WALCOM: Algorithms and Computation, 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

Designing and Implementing Algorithms for the Closest String Problem.
Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017

Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

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

An Analytical Framework for Multilayer Partial Frequency Reuse Scheme Design in Mobile Communication Systems.
IEEE Trans. Vehicular Technology, 2016

Better ILP-Based Approaches to Haplotype Assembly.
Journal of Computational Biology, 2016

Optimal Power Allocation for Wireless Uplink Transmissions Using Successive Interference Cancellation.
TIIS, 2016

Practical framework for ultra-fair dynamic interference coordination in mobile communication systems.
IET Communications, 2016

Cooperative Application Execution in Mobile Cloud Computing: A Stackelberg Game Approach.
IEEE Communications Letters, 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

Deadline-aware cooperative data exchange with network coding.
Computer Networks, 2016

Green latency-aware data placement in data centers.
Computer Networks, 2016

Protein-protein interface prediction based on hexagon structure similarity.
Computational Biology and Chemistry, 2016

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

Efficient resource allocation and interference management using compressive sensing in dense mobile communication systems.
Proceedings of the 8th International Conference on Wireless Communications & Signal Processing, 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
Accurate Measurement and Detailed Evaluation of Static Electromagnetic Characteristics of Switched Reluctance Machines.
IEEE Trans. Instrumentation and Measurement, 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. Biology Bioinform., 2015

Cell Selection Game for Densely-Deployed Sensor and Mobile Devices In 5G Networks Integrating Heterogeneous Cells and the Internet of Things.
Sensors, 2015

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

A Dynamic Programming Algorithm For (1, 2)-Exemplar Breakpoint Distance.
Journal of Computational Biology, 2015

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

Priority-based cell selection for mobile equipments in heterogeneous cloud radio access networks.
Proceedings of the International Conference on Connected Vehicles and Expo, 2015

Performance evaluation of dynamic interference coordination algorithms.
Proceedings of the 10th International Conference on Communications and Networking in China, 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. Biology Bioinform., 2014

Probabilistic Models for Capturing More Physicochemical Properties on Protein-Protein Interface.
Journal of Chemical Information and Modeling, 2014

To Achieve Maximal Throughputs in CSMA Wireless Networks Through Offered_load Control.
CoRR, 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

Fan-Shaped Clustering for Large-Scale Sensor Networks.
Proceedings of the 2014 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, 2014

Spectrum Allocation in Cognitive Radio - Quantum Immune Clonal Based Approach.
Proceedings of the 2014 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, 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
Cooperative Scheduling for Coexisting Body Area Networks.
IEEE Trans. Wireless Communications, 2013

An Exact Algorithm for the Zero Exemplar Breakpoint Distance Problem.
IEEE/ACM Trans. Comput. Biology 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.
Journal of Computational Biology, 2013

An Ultrafast Tool for Minimum Reticulate Networks.
Journal of Computational Biology, 2013

Interval Structure: A Framework for Representing Uncertain Information
CoRR, 2013

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

Mathematical Modeling for Network Selection in Heterogeneous Wireless Networks - A Tutorial.
IEEE Communications Surveys and Tutorials, 2013

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

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

Detecting Protein Conformational Changes in Interactions via Scaling Known Structures.
Proceedings of the Research in Computational Molecular Biology, 2013

Blind interference alignment over homogeneous 3-user 2 × 1 broadcast channel.
Proceedings of the International Workshop on High Mobility Wireless Communications, 2013

Highly dynamic or semi-static: Resource allocation for high-speed mobile terminals in 4G.
Proceedings of the International Workshop on High Mobility Wireless Communications, 2013

Toward High-Payoff Nash Equilibria for Interference Game between Body Area Networks.
Proceedings of the 2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, 2013

A Polynomial Time Approximation Scheme for the Closest Shared Center Problem.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings.
Proceedings of the Combinatorial Optimization and Applications, 2013

Identifying duplications and lateral gene transfers simultaneously and rapidly.
Proceedings of the 2013 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB), 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. Biology Bioinform., 2012

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

Simultaneous Identification of Duplications, Losses, and Lateral Gene Transfers.
IEEE/ACM Trans. Comput. Biology 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 Bioinformatics, 2012

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

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

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

Low complexity grouping for massive scheduling in 4G networks.
Proceedings of the 10th International Symposium on Modeling and Optimization in Mobile, 2012

OpenAirInterface Traffic Generator (OTG): A Realistic Traffic Generation Tool for Emerging Application Scenarios.
Proceedings of the 20th IEEE International Symposium on Modeling, 2012

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

The Parameterized Complexity of the Shared Center Problem.
Proceedings of the Combinatorial Pattern Matching - 23rd Annual 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. Biology Bioinform., 2011

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

Protein-Protein Binding Sites Prediction by 3D Structural Similarities.
Journal of Chemical Information and Modeling, 2011

An Approximation Algorithm for the Minimum Co-Path Set Problem.
Algorithmica, 2011

Computing the Protein Binding Sites.
Proceedings of the Bioinformatics Research and Applications - 7th International Symposium, 2011

An Improved Approximation Algorithm for the Complementary Maximal Strip Recovery Problem.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

2010
Network selection in heterogeneous wireless networks. (Sélection de Réseau dans les Réseaux Sans Fil Hétérogènes).
PhD thesis, 2010

Finding the Nearest Neighbors in Biological Databases Using Less Distance Computations.
IEEE/ACM Trans. Comput. Biology Bioinform., 2010

Modeling Protein Interacting Groups by Quasi-Bicliques: Complexity, Algorithm, and Application.
IEEE/ACM Trans. Comput. Biology Bioinform., 2010

Beyond evolutionary trees.
Natural Computing, 2010

On the Tractability of Maximal Strip Recovery.
Journal of Computational Biology, 2010

Identification of Distinguishing Motifs.
IJKDB, 2010

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

HybridNET: a tool for constructing hybridization networks.
Bioinformatics, 2010

Near Optimal Solutions for Maximum Quasi-bicliques.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

Constant Time Approximation Scheme for Largest Well Predicted Subset.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

A Three-String Approach to the Closest String Problem.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 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. Biology Bioinform., 2009

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

On bipartite graphs with minimal energy.
Discrete Applied Mathematics, 2009

An improved randomized approximation algorithm for maximum triangle packing.
Discrete Applied Mathematics, 2009

Linked region detection using high-density SNP genotype data via the minimum recombinant model of pedigree haplotype inference.
BMC Bioinformatics, 2009

Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats.
Algorithmica, 2009

Mobility-Based Network Selection Scheme in Heterogeneous Wireless Networks.
Proceedings of the 69th IEEE Vehicular Technology Conference, 2009

On the Tractability of Maximal Strip Recovery.
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 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

Best permutation: a novel network selection scheme in heterogeneous wireless networks.
Proceedings of the International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly, 2009

Efficient Algorithms for the Closest String and Distinguishing String Selection Problems.
Proceedings of the Frontiers in Algorithmics, Third International Workshop, 2009

TRUST: A Trigger-Based Automatic Subjective Weighting Method for Network Selection.
Proceedings of the Fifth Advanced International Conference on Telecommunications, 2009

2008
Biology Computing.
Proceedings of the Wiley Encyclopedia of Computer Science and Engineering, 2008

Closest String and Substring Problems.
Proceedings of the Encyclopedia of Algorithms, 2008

Relay sensor placement in wireless sensor networks.
Wireless Networks, 2008

A (1.5 + epsilon)-Approximation Algorithm for Unsigned Translocation Distance.
IEEE/ACM Trans. Comput. Biology 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.
Journal of Computational Biology, 2008

Identification of linked regions using high-density SNP genotype data in linkage analysis.
Bioinformatics, 2008

Space Efficient Algorithms for Ordered Tree Comparison.
Algorithmica, 2008

Novel MAP Selection Scheme Using Location History in Hierarchical MIPv6 Networks.
Proceedings of the WCNC 2008, IEEE Wireless Communications & Networking Conference, March 31 2008, 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

An Improved Randomized Approximation Algorithm for Maximum Triangle Packing.
Proceedings of the Algorithmic Aspects in Information and Management, 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.
Discrete Applied Mathematics, 2007

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

Foreword.
Algorithmica, 2007

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

Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

Preface.
Proceedings of 5th Asia-Pacific Bioinformatics Conference, 2007

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

Optimal Relay Location for Resource-limited Energy-efficient Wireless Communication.
J. Global Optimization, 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 for Molecular Biology, 2006

Translocation Distance: Algorithms and Complexity.
Advances in Computers, 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 O(n2) 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. Bioinformatics and Computational Biology, 2005

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

Decomposing toroidal graphs into circuits and edges.
Discrete Applied Mathematics, 2005

Space Efficient Algorithms for Ordered Tree Comparison.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

A 1.75-Approximation Algorithm for Unsigned Translocation Distance.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

An O(N2) 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.
Discrete Mathematics, 2004

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

Minimum k Arborescences with Bandwidth Constraints.
Algorithmica, 2004

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

On the Complexity of Finding Emerging Patterns.
Proceedings of the 28th International Computer Software and Applications Conference (COMPSAC 2004), 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. Discrete Math., 2003

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

The Inverse Problems for Some Topological Indices in Combinatorial Chemistry.
Journal of Computational Biology, 2003

Greedy method for inferring tandem duplication history.
Bioinformatics, 2003

Parametric alignment of ordered trees.
Bioinformatics, 2003

Haplotype inference by maximum parsimony.
Bioinformatics, 2003

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

On Constrained Minimum Pseudotriangulations.
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 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

Approximations for a Bottleneck Steiner Tree Problem.
Algorithmica, 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.
Journal of Computational Biology, 2001

Perfect phylogenetic networks with recombination.
Proceedings of the 2001 ACM Symposium on Applied Computing (SAC), 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
A More Efficient Approximation Scheme for Tree Alignment.
SIAM J. Comput., 2000

Approximations for Steiner Trees with Minimum Number of Steiner Points.
J. Global Optimization, 2000

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

Fixed topology alignment with recombination.
Discrete Applied Mathematics, 2000

On The Closest String and Substring Problems
CoRR, 2000

Near optimal multiple alignment within a band in polynomial time.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

1999
Fixed Topology Steiner Trees and Spanning Forests.
Theor. Comput. Sci., 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

Computing Similarity between RNA Structures.
Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999

1998
Constructing Additive Trees When the Error Is Small.
Journal of Computational Biology, 1998

Graph Traversals, Genes and Matroids: An Efficient Case of the Travelling Salesman Problem.
Discrete Applied Mathematics, 1998

New uses for uniform lifted alignments.
Proceedings of the Mathematical Support for Molecular Biology, 1998

Fixed Topology Alignment with Recombination.
Proceedings of the Combinatorial Pattern Matching, 9th Annual Symposium, 1998

1997
Improved Approximation Algorithms for Tree Alignment.
J. Algorithms, 1997

A group multicast routing algorithm by using multiple minimum Steiner trees.
Computer Communications, 1997

A more efficient approximation scheme for tree alignment.
Proceedings of the First Annual International Conference on Research in Computational Molecular Biology, 1997

Fixed Topology Steiner Trees and Spanning Forests with Applications in Network Communications.
Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996
An approximation scheme for some Steiner tree problems in the plane.
Networks, 1996

On the Completeness of Incidence Calculus.
J. Autom. Reasoning, 1996

On the Complexity of Comparing Evolutionary Trees.
Discrete Applied Mathematics, 1996

Approximation Algorithms for Tree Alignment with a Given Phylogeny.
Algorithmica, 1996

Improved Approximation Algorithms for Tree Alignment.
Proceedings of the Combinatorial Pattern Matching, 7th Annual Symposium, 1996

Graph Traversals, Genes, and Matroids: An Efficient Case of the Travelling Salesman Problem.
Proceedings of the Combinatorial Pattern Matching, 7th Annual Symposium, 1996

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

On Modeling Uncertainty with Interval Structures.
Computational Intelligence, 1995

On the Complexity of Comparing Evolutionary Trees (Extended Abstract).
CPM, 1995

1994
On the Complexity of Multiple Sequence Alignment.
Journal of Computational Biology, 1994

Aligning sequences via an evolutionary tree: complexity and approximation.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

An Approximation Scheme for Some Steiner Tree Problems in the Plane.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Alignment of Trees - An Alternative to Tree Edit.
Proceedings of the Combinatorial Pattern Matching, 5th Annual Symposium, 1994

1992
Interval Structure: A Framework for Representing Uncertain Information.
Proceedings of the UAI '92: Proceedings of the Eighth Annual Conference on Uncertainty in Artificial Intelligence, 1992

Non-Numeric Belief Structures.
Proceedings of the Computing and Information, 1992


  Loading...