Louxin Zhang
Orcid: 0000-0003-0260-824X
According to our database1,
Louxin Zhang
authored at least 121 papers
between 1991 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
The tree-child network inference problem for line trees and the shortest common supersequence problem for permutation strings.
J. Comput. Syst. Sci., 2024
Computing the Bounds of the Number of Reticulations in a Tree-Child Network That Displays a Set of Trees.
J. Comput. Biol., 2024
J. Comput. Biol., 2024
2023
Bounding the Number of Reticulations in a Tree-Child Network that Displays a Set of Trees.
Proceedings of the Comparative Genomics - 20th International Conference, 2023
Proceedings of the Comparative Genomics - 20th International Conference, 2023
2022
J. Comb. Theory A, 2022
How much can deep learning improve prediction of the responses to drugs in cancer cell lines?
Briefings Bioinform., 2022
Proceedings of the Comparative Genomics - 19th International Conference, 2022
2021
IEEE ACM Trans. Comput. Biol. Bioinform., 2021
Introduction to the Special Issue of the 18th Annual International RECOMB Satellite Workshop on Comparative Genomics.
J. Bioinform. Comput. Biol., 2021
A survey and systematic assessment of computational methods for drug response prediction.
Briefings Bioinform., 2021
2020
J. Comput. Syst. Sci., 2020
Recent Progresses in the Combinatorial and Algorithmic Study of Rooted Phylogenetic Networks.
Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020
2019
J. Comput. Biol., 2019
BMC Bioinform., 2019
BMC Bioinform., 2019
2018
Theor. Comput. Sci., 2018
Solving the tree containment problem in linear time for nearly stable phylogenetic networks.
Discret. Appl. Math., 2018
CoRR, 2018
S-Cluster++: a fast program for solving the cluster containment problem for phylogenetic networks.
Bioinform., 2018
2017
Inf. Comput., 2017
A program to compute the soft Robinson-Foulds distance between phylogenetic networks.
BMC Genom., 2017
2016
CoRR, 2016
Proceedings of the Research in Computational Molecular Biology - 20th Annual Conference, 2016
2015
Stability Implies Computational Tractability: Locating a Tree in a Stable Network is Easy.
CoRR, 2015
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. Biol. Bioinform., 2014
J. Comput. Biol., 2014
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. Biol. 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. Bioinform. Comput. Biol., 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
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
Two combinatorial optimization problems for SNP discovery using base-specific cleavage and mass spectrometry.
BMC Syst. Biol., 2012
Reconstruction of Network Evolutionary History from Extant Network Topology and Duplication History.
Proceedings of the Bioinformatics Research and Applications - 8th International Symposium, 2012
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. Biol. 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 Bioinform., 2011
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
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
Computational Biology 7, Springer, ISBN: 978-1-84800-319-4, 2009
Proceedings of the Comparative Genomics, International Workshop, 2009
2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
Approximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment.
SIAM J. Comput., 2008
J. Comput. Biol., 2008
J. Comput. Biol., 2008
J. Comput. Biol., 2008
A PTAS For The <i>k</i>-Consensus Structures Problem Under Squared Euclidean Distance.
Algorithms, 2008
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
IEEE ACM Trans. Comput. Biol. Bioinform., 2007
Reconstructing Recombination Network from Sequence Data: The Small Parsimony Problem.
IEEE ACM Trans. Comput. Biol. Bioinform., 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
Proceedings of the Comparative Genomics, RECOMB 2007 International Workshop, 2007
Proceedings of the Comparative Genomics, RECOMB 2007 International Workshop, 2007
Proceedings of the 7th IEEE International Conference on Bioinformatics and Bioengineering, 2007
2006
Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006
Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006
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
J. Comput. Biol., 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
J. Comput. Syst. Sci., 2004
Int. J. Found. Comput. Sci., 2004
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
2003
2002
Proceedings of the Algorithms in Bioinformatics, Second International Workshop, 2002
Proceedings of the 1st IEEE Computer Society Bioinformatics Conference, 2002
2001
Bioinform., 2001
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001
2000
Separating Auxiliary Arity Hierarchy of First-Order Incremental Evaluation Systems Using (3k+1)-ary Input Relations.
Int. J. Found. Comput. Sci., 2000
1999
J. Algorithms, 1999
Proceedings of the Discrete Mathematical Problems with Medical Applications, 1999
1998
Theor. Comput. Sci., 1998
Proceedings of the SIGMOD 1998, 1998
Proceedings of the Second Annual International Conference on Research in Computational Molecular Biology, 1998
Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998
1997
J. Comput. Biol., 1997
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997
Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997
1996
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
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995
1993
1992
Inf. Process. Lett., 1992
Int. J. Algebra Comput., 1992
1991
Decision Problems for Finite Special String-Rewriting Systems that are Confluent on Some Congruence Class.
Acta Informatica, 1991