Louxin Zhang

According to our database1, Louxin Zhang
  • authored at least 99 papers between 1991 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Reconciliation With Nonbinary Gene Trees Revisited.
J. ACM, 2017

A decomposition theorem and two algorithms for reticulation-visible networks.
Inf. Comput., 2017

2016
Superiority and Complexity of the Spaced Seeds.
Encyclopedia of Algorithms, 2016

Nearest Neighbor Interchange and Related Distances.
Encyclopedia of Algorithms, 2016

On Tree-Based Phylogenetic Networks.
Journal of Computational Biology, 2016

Locating a Phylogenetic Tree in a Reticulation-Visible Network in Quadratic Time.
CoRR, 2016

A program for verification of phylogenetic network models.
Bioinformatics, 2016

2015
Bounding the Size of a Network Defined By Visibility Property.
CoRR, 2015

Stability Implies Computational Tractability: Locating a Tree in a Stable Network is Easy.
CoRR, 2015

Locating a Tree in a Phylogenetic Network in Quadratic Time.
CoRR, 2015

Locating a Tree in a Phylogenetic Network in Quadratic Time.
Proceedings of the Research in Computational Molecular Biology, 2015

Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time.
Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

2014
Effect of Incomplete Lineage SortingOn Tree-Reconciliation-Based Inferenceof Gene Duplication.
IEEE/ACM Trans. Comput. Biology Bioinform., 2014

Are the Duplication Cost and Robinson-Foulds Distance Equivalent?
Journal of Computational Biology, 2014

Reconciliation with Non-binary Gene Trees Revisited.
Proceedings of the Research in Computational Molecular Biology, 2014

2013
Maximum Likelihood Inference of the Evolutionary History of a PPI Network from the Duplication History of Its Proteins.
IEEE/ACM Trans. Comput. Biology Bioinform., 2013

Motif Discovery with Data Mining in 3D protein Structure Databases: Discovery, Validation and Prediction of the U-Shape zinc binding ("Huf-zinc") Motif.
J. Bioinformatics and Computational Biology, 2013

Counting Motifs in the Entire Biological Network from Noisy and Incomplete Data - (Extended Abstract).
Proceedings of the Research in Computational Molecular Biology, 2013

Effect of Incomplete Lineage Sorting on Tree-Reconciliation-Based Inference of Gene Duplication.
Proceedings of the Bioinformatics Research and Applications, 9th International Symposium, 2013

A Tool for Non-binary Tree Reconciliation.
Proceedings of the Bioinformatics Research and Applications, 9th International Symposium, 2013

A Linear-Time Algorithm for Reconciliation of Non-binary Gene Tree and Binary Species Tree.
Proceedings of the Combinatorial Optimization and Applications, 2013

2012
Approximating the Spanning k-Tree forest Problem.
Int. J. Found. Comput. Sci., 2012

Two combinatorial optimization problems for SNP discovery using base-specific cleavage and mass spectrometry.
BMC Systems Biology, 2012

Reconstruction of Network Evolutionary History from Extant Network Topology and Duplication History.
Proceedings of the Bioinformatics Research and Applications - 8th International Symposium, 2012

Alignment seeding strategies using contiguous pyrimidine purine matches.
Proceedings of the ACM International Conference on Bioinformatics, 2012

2011
From Gene Trees to Species Trees II: Species Tree Inference by Minimizing Deep Coalescence Events.
IEEE/ACM Trans. Comput. Biology Bioinform., 2011

Efficient estimation of the accuracy of the maximum likelihood method for ancestral state reconstruction.
J. Comb. Optim., 2011

Structural properties of the reconciliation space and their applications in enumerating nearly-optimal reconciliations between a gene tree and a species tree.
BMC Bioinformatics, 2011

A Polynomial Algebra Method for Computing Exemplar Breakpoint Distance.
Proceedings of the Bioinformatics Research and Applications - 7th International Symposium, 2011

Network model and efficient method for detecting relative duplications or horizontal gene transfers.
Proceedings of the IEEE 1st International Conference on Computational Advances in Bio and Medical Sciences, 2011

2010
CAGE: Combinatorial Analysis of Gene-Cluster Evolution.
Journal of Computational Biology, 2010

An Efficient Method for DNA-Based Species Assignment via Gene Tree and Species Tree Reconciliation.
Proceedings of the Algorithms in Bioinformatics, 10th International Workshop, 2010

2009
Sequence Comparison - Theory and Methods
Computational Biology 7, Springer, ISBN: 978-1-84800-319-4, 2009

Inferring the Recent Duplication History of a Gene Cluster.
Proceedings of the Comparative Genomics, International Workshop, 2009

Approximating the Spanning k-Tree Forest Problem.
Proceedings of the Frontiers in Algorithmics, Third International Workshop, 2009

2008
Nearest Neighbor Interchange and Related Distances.
Proceedings of the Encyclopedia of Algorithms, 2008

Approximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment.
SIAM J. Comput., 2008

Run Probabilities of Seed-Like Patterns and Identifying Good Transition Seeds.
Journal of Computational Biology, 2008

DUPCAR: Reconstructing Contiguous Ancestral Regions with Duplications.
Journal of Computational Biology, 2008

Spectrum-Based De Novo Repeat Detection in Genomic Sequences.
Journal of Computational Biology, 2008

A PTAS For The k-Consensus Structures Problem Under Squared Euclidean Distance.
Algorithms, 2008

A PTAS for the k-Consensus Structures Problem Under Euclidean Squared Distance.
Proceedings of the Frontiers in Algorithmics, Second Annual International Workshop, 2008

Run Probability of High-Order Seed Patterns and its Applications to Finding Good Transition Seeds.
Proceedings of the 6th Asia-Pacific Bioinformatics Conference, 2008

2007
Superiority of Spaced Seeds for Homology Search.
IEEE/ACM Trans. Comput. Biology Bioinform., 2007

Reconstructing Recombination Network from Sequence Data: The Small Parsimony Problem.
IEEE/ACM Trans. Comput. Biology Bioinform., 2007

The Consecutive Ones Submatrix Problem for Sparse Matrices.
Algorithmica, 2007

Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis.
Algorithmica, 2007

Approximating the spanning star forest problem and its applications to genomic sequence alignment.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

A Heuristic Algorithm for Reconstructing Ancestral Gene Orders with Duplications.
Proceedings of the Comparative Genomics, RECOMB 2007 International Workshop, 2007

Selecting Genomes for Reconstruction of Ancestral Genomes.
Proceedings of the Comparative Genomics, RECOMB 2007 International Workshop, 2007

A Robust Method for Generating Discriminative Gene Clusters.
Proceedings of the 7th IEEE International Conference on Bioinformatics and Bioengineering, 2007

2006
Models and Methods in Comparative Genomics.
Advances in Computers, 2006

Controlling Size When Aligning Multiple Genomic Sequences with Duplications.
Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006

Procrastination Leads to Efficient Filtration for Local Multiple Alignment.
Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006

Superiority and complexity of the spaced seeds.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005
Translation Initiation Sites Prediction with Mixture Gaussian Models in Human cDNA Sequences.
IEEE Trans. Knowl. Data Eng., 2005

Quick, Practical Selection of Effective Seeds for Homology Search.
Journal of Computational Biology, 2005

Divide-and-conquer approach for the exemplar breakpoint distance.
Bioinformatics, 2005

Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
Sensitivity analysis and efficient method for identifying optimal spaced seeds.
J. Comput. Syst. Sci., 2004

Computing And Combinatorics Conference -- Cocoon'02.
Int. J. Found. Comput. Sci., 2004

Good spaced seeds for homology search.
Bioinformatics, 2004

Translation Initiation Sites Prediction with Mixture Gaussian Models.
Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004

Approximation Algorithms for the Consecutive Ones Submatrix Problem on Sparse Matrices.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Good Spaced Seeds For Homology Search.
Proceedings of the 4th IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2004), 2004

2003
Distinguishing string selection problems.
Inf. Comput., 2003

Greedy method for inferring tandem duplication history.
Bioinformatics, 2003

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

A New Clustering Method for Microarray Data Analysis.
Proceedings of the 1st IEEE Computer Society Bioinformatics Conference, 2002

2001
Perfect Phylogenetic Networks with Recombination.
Journal of Computational Biology, 2001

Cladogramer: incorporating haplotype frequency into cladogram analysis.
Bioinformatics, 2001

Perfect phylogenetic networks with recombination.
Proceedings of the 2001 ACM Symposium on Applied Computing (SAC), 2001

Complexity Study on Two Clustering Problems.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

2000
From Gene Trees to Species Trees.
SIAM J. Comput., 2000

Separating Auxiliary Arity Hierarchy of First-Order Incremental Evaluation Systems Using (3k+1)-ary Input Relations.
Int. J. Found. Comput. Sci., 2000

1999
Optimal Bounds for Matching Routing on Trees.
SIAM J. Discrete Math., 1999

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

Twist-Rotation Transformations of Binary Trees and Arithmetic Expressions.
J. Algorithms, 1999

WebPHYLIP: a web interface to PHYLIP.
Bioinformatics, 1999

Distinguishing String Selection Problems.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

On computing the nearest neighbor interchange distance.
Proceedings of the Discrete Mathematical Problems with Medical Applications, 1999

1998
Addition in log2n + O(1) Steps on Average: A Simple Analysis.
Theor. Comput. Sci., 1998

A Protein Patent Query System Powered By Kleisli.
Proceedings of the SIGMOD 1998, 1998

On reconstructing species trees from gene trees in term of duplications and losses.
Proceedings of the Second Annual International Conference on Research in Computational Molecular Biology, 1998

Better Approximation of Diagonal-Flip Transformation and Rotation Transformation.
Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997
Small Weight Bases for Hamming Codes.
Theor. Comput. Sci., 1997

Optimal Bounds for Matching Routing on Trees.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

On Distances between Phylogenetic Trees (Extended Abstract).
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Many-to-One Packed Routing via Matchings.
Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996
Addition in log2n + O(1) Steps on Average: A Simple Analysis
Electronic Colloquium on Computational Complexity (ECCC), 1996

On the descriptive power of special Thue systems.
Discrete Mathematics, 1996

Some Notes on the Nearest Neighbour Interchange Distance.
Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995
On the Approximation of Longest Common Nonsupersequences and Shortest Common Nonsubsequences.
Theor. Comput. Sci., 1995

Routing on Trees via Matchings.
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

Small Weight Bases for Hamming Codes.
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1993
On Weakly Confluent Monadic String-Rewriting Systems.
Theor. Comput. Sci., 1993

1992
The Pre-NTS Property is Undecidable for Context-Free Grammars.
Inf. Process. Lett., 1992

On the Conjugacy Problem for One-Relator Monoids with Elements of Finite Order.
IJAC, 1992

1991
Decision Problems for Finite Special String-Rewriting Systems that are Confluent on Some Congruence Class.
Acta Inf., 1991


  Loading...