| 2008 |
|---|
| 62 | EE | Jialiang Yang,
Louxin Zhang:
Run Probability of High-Order Seed Patterns and its Applications to Finding Good Transition Seeds.
APBC 2008: 123-132 |
| 61 | EE | Shuai Cheng Li,
Yen Kaow Ng,
Louxin Zhang:
A PTAS for the k-Consensus Structures Problem Under Euclidean Squared Distance.
FAW 2008: 35-44 |
| 60 | EE | Bhaskar DasGupta,
Xin He,
Tao Jiang,
Ming Li,
John Tromp,
Louxin Zhang:
Nearest Neighbor Interchange and Related Distances.
Encyclopedia of Algorithms 2008 |
| 59 | EE | Jialiang Yang,
Louxin Zhang:
Run Probabilities of Seed-Like Patterns and Identifying Good Transition Seeds.
Journal of Computational Biology 15(10): 1295-1313 (2008) |
| 58 | EE | Huy Hoang Do,
Kwok Pui Choi,
Franco P. Preparata,
Wing-Kin Sung,
Louxin Zhang:
Spectrum-Based De Novo Repeat Detection in Genomic Sequences.
Journal of Computational Biology 15(5): 469-488 (2008) |
| 57 | EE | Jian Ma,
Aakrosh Ratan,
Brian J. Raney,
Bernard B. Suh,
Louxin Zhang,
Webb Miller,
David Haussler:
DUPCAR: Reconstructing Contiguous Ancestral Regions with Duplications.
Journal of Computational Biology 15(8): 1007-1027 (2008) |
| 56 | EE | C. Thach Nguyen,
Jian Shen,
Minmei Hou,
Li Sheng,
Webb Miller,
Louxin Zhang:
Approximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment.
SIAM J. Comput. 38(3): 946-962 (2008) |
| 2007 |
|---|
| 55 | EE | Min Xu,
Louxin Zhang,
Pei Li Joe Zhou:
A Robust Method for Generating Discriminative Gene Clusters.
BIBE 2007: 538-545 |
| 54 | EE | Guoliang Li,
Jian Ma,
Louxin Zhang:
Selecting Genomes for Reconstruction of Ancestral Genomes.
RECOMB-CG 2007: 110-121 |
| 53 | EE | Jian Ma,
Aakrosh Ratan,
Louxin Zhang,
Webb Miller,
David Haussler:
A Heuristic Algorithm for Reconstructing Ancestral Gene Orders with Duplications.
RECOMB-CG 2007: 122-135 |
| 52 | EE | C. Thach Nguyen,
Jian Shen,
Minmei Hou,
Li Sheng,
Webb Miller,
Louxin Zhang:
Approximating the spanning star forest problem and its applications to genomic sequence alignment.
SODA 2007: 645-654 |
| 51 | EE | Jinsong Tan,
Kok Seng Chua,
Louxin Zhang,
Song Zhu:
Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis.
Algorithmica 48(2): 203-219 (2007) |
| 50 | EE | Jinsong Tan,
Louxin Zhang:
The Consecutive Ones Submatrix Problem for Sparse Matrices.
Algorithmica 48(3): 287-299 (2007) |
| 49 | EE | C. Thach Nguyen,
Nguyen Bao Nguyen,
Wing-Kin Sung,
Louxin Zhang:
Reconstructing Recombination Network from Sequence Data: The Small Parsimony Problem.
IEEE/ACM Trans. Comput. Biology Bioinform. 4(3): 394-402 (2007) |
| 48 | EE | Louxin Zhang:
Superiority of Spaced Seeds for Homology Search.
IEEE/ACM Trans. Comput. Biology Bioinform. 4(3): 496-505 (2007) |
| 2006 |
|---|
| 47 | EE | Ming Li,
Bin Ma,
Louxin Zhang:
Superiority and complexity of the spaced seeds.
SODA 2006: 444-453 |
| 46 | EE | Aaron E. Darling,
Todd J. Treangen,
Louxin Zhang,
Carla Kuiken,
Xavier Messeguer,
Nicole T. Perna:
Procrastination Leads to Efficient Filtration for Local Multiple Alignment.
WABI 2006: 126-137 |
| 45 | EE | Minmei Hou,
Piotr Berman,
Louxin Zhang,
Webb Miller:
Controlling Size When Aligning Multiple Genomic Sequences with Duplications.
WABI 2006: 138-149 |
| 44 | | Guillaume Bourque,
Louxin Zhang:
Models and Methods in Comparative Genomics.
Advances in Computers 68: 60-105 (2006) |
| 2005 |
|---|
| 43 | EE | Jinsong Tan,
Kok Seng Chua,
Louxin Zhang:
Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis.
COCOON 2005: 74-83 |
| 42 | EE | C. Thach Nguyen,
Y. C. Tay,
Louxin Zhang:
Divide-and-conquer approach for the exemplar breakpoint distance.
Bioinformatics 21(10): 2171-2176 (2005) |
| 41 | EE | Guoliang Li,
Tze-Yun Leong,
Louxin Zhang:
Translation Initiation Sites Prediction with Mixture Gaussian Models in Human cDNA Sequences.
IEEE Trans. Knowl. Data Eng. 17(8): 1152-1160 (2005) |
| 40 | EE | Franco P. Preparata,
Louxin Zhang,
Kwok Pui Choi:
Quick, Practical Selection of Effective Seeds for Homology Search.
Journal of Computational Biology 12(9): 1137-1152 (2005) |
| 2004 |
|---|
| 39 | EE | Kwok Pui Choi,
Fanfan Zeng,
Louxin Zhang:
Good Spaced Seeds For Homology Search.
BIBE 2004: 379-386 |
| 38 | EE | Jinsong Tan,
Louxin Zhang:
Approximation Algorithms for the Consecutive Ones Submatrix Problem on Sparse Matrices.
ISAAC 2004: 835-846 |
| 37 | EE | Guoliang Li,
Tze-Yun Leong,
Louxin Zhang:
Translation Initiation Sites Prediction with Mixture Gaussian Models.
WABI 2004: 338-349 |
| 36 | EE | Kwok Pui Choi,
Fanfan Zeng,
Louxin Zhang:
Good spaced seeds for homology search.
Bioinformatics 20(7): 1053-1059 (2004) |
| 35 | EE | Oscar H. Ibarra,
Louxin Zhang:
Computing And Combinatorics Conference -- Cocoon'02.
Int. J. Found. Comput. Sci. 15(1): 1 (2004) |
| 34 | EE | Kwok Pui Choi,
Louxin Zhang:
Sensitivity analysis and efficient method for identifying optimal spaced seeds.
J. Comput. Syst. Sci. 68(1): 22-40 (2004) |
| 2003 |
|---|
| 33 | | Louxin Zhang,
Bin Ma,
Lusheng Wang,
Ying Xu:
Greedy method for inferring tandem duplication history.
Bioinformatics 19(12): 1497-1504 (2003) |
| 32 | EE | J. Kevin Lanctot,
Ming Li,
Bin Ma,
Shaojiu Wang,
Louxin Zhang:
Distinguishing string selection problems.
Inf. Comput. 185(1): 41-55 (2003) |
| 2002 |
|---|
| 31 | | Oscar H. Ibarra,
Louxin Zhang:
Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings
Springer 2002 |
| 30 | EE | Louxin Zhang,
Song Zhu:
A New Clustering Method for Microarray Data Analysis.
CSB 2002: 268-275 |
| 29 | EE | Louxin Zhang,
Bin Ma,
Lusheng Wang:
Efficient Methods for Inferring Tandem Duplication History.
WABI 2002: 97-111 |
| 2001 |
|---|
| 28 | EE | Louxin Zhang,
Song Zhu:
Complexity Study on Two Clustering Problems.
ISAAC 2001: 660-669 |
| 27 | EE | Lusheng Wang,
Kaizhong Zhang,
Louxin Zhang:
Perfect phylogenetic networks with recombination.
SAC 2001: 46-50 |
| 26 | | Louxin Zhang,
Chew-Kiat Heng,
Tin Wee Tan:
Cladogramer: incorporating haplotype frequency into cladogram analysis.
Bioinformatics 17(5): 481-482 (2001) |
| 25 | | Lusheng Wang,
Kaizhong Zhang,
Louxin Zhang:
Perfect Phylogenetic Networks with Recombination.
Journal of Computational Biology 8(1): 69-78 (2001) |
| 2000 |
|---|
| 24 | | Guozhu Dong,
Louxin Zhang:
Separating Auxiliary Arity Hierarchy of First-Order Incremental Evaluation Systems Using (3k+1)-ary Input Relations.
Int. J. Found. Comput. Sci. 11(4): 573-578 (2000) |
| 23 | EE | Bin Ma,
Ming Li,
Louxin Zhang:
From Gene Trees to Species Trees.
SIAM J. Comput. 30(3): 729-752 (2000) |
| 1999 |
|---|
| 22 | EE | J. Kevin Lanctot,
Ming Li,
Bin Ma,
Shaojiu Wang,
Louxin Zhang:
Distinguishing String Selection Problems.
SODA 1999: 633-642 |
| 21 | | Allison Lim,
Louxin Zhang:
WebPHYLIP: a web interface to PHYLIP.
Bioinformatics 15(12): 1068-1069 (1999) |
| 20 | | Ming Li,
Louxin Zhang:
Twist-Rotation Transformations of Binary Trees and Arithmetic Expressions.
J. Algorithms 32(2): 155-166 (1999) |
| 19 | | Bin Ma,
Lusheng Wang,
Louxin Zhang:
Fitting Distances by Tree Metrics with Increment Error.
J. Comb. Optim. 3(2-3): 213-225 (1999) |
| 18 | EE | Louxin Zhang:
Optimal Bounds for Matching Routing on Trees.
SIAM J. Discrete Math. 12(1): 64-77 (1999) |
| 1998 |
|---|
| 17 | EE | Ming Li,
Louxin Zhang:
Better Approximation of Diagonal-Flip Transformation and Rotation Transformation.
COCOON 1998: 85-94 |
| 16 | EE | Bin Ma,
Ming Li,
Louxin Zhang:
On reconstructing species trees from gene trees in term of duplications and losses.
RECOMB 1998: 182-191 |
| 15 | EE | Jing Chen,
Limsoon Wong,
Louxin Zhang:
A Protein Patent Query System Powered By Kleisli.
SIGMOD Conference 1998: 593-595 |
| 14 | EE | Richard Beigel,
William I. Gasarch,
Ming Li,
Louxin Zhang:
Addition in log2n + O(1) Steps on Average: A Simple Analysis.
Theor. Comput. Sci. 191(1-2): 245-248 (1998) |
| 1997 |
|---|
| 13 | | Danny Krizanc,
Louxin Zhang:
Many-to-One Packed Routing via Matchings.
COCOON 1997: 11-17 |
| 12 | | Bhaskar DasGupta,
Xin He,
Tao Jiang,
Ming Li,
John Tromp,
Louxin Zhang:
On Distances between Phylogenetic Trees (Extended Abstract).
SODA 1997: 427-436 |
| 11 | | Louxin Zhang:
Optimal Bounds for Matching Routing on Trees.
SODA 1997: 445-453 |
| 10 | EE | John Tromp,
Louxin Zhang,
Ying Zhao:
Small Weight Bases for Hamming Codes.
Theor. Comput. Sci. 181(2): 337-345 (1997) |
| 1996 |
|---|
| 9 | | Ming Li,
John Tromp,
Louxin Zhang:
Some Notes on the Nearest Neighbour Interchange Distance.
COCOON 1996: 343-351 |
| 8 | EE | Louxin Zhang,
Lian Li,
Jinzhao Wu:
On the descriptive power of special Thue systems.
Discrete Mathematics 160(1-3): 291-297 (1996) |
| 7 | EE | Richard Beigel,
William I. Gasarch,
Ming Li,
Louxin Zhang:
Addition in log2n + O(1) Steps on Average: A Simple Analysis
Electronic Colloquium on Computational Complexity (ECCC) 3(51): (1996) |
| 1995 |
|---|
| 6 | | John Tromp,
Louxin Zhang,
Ying Zhao:
Small Weight Bases for Hamming Codes.
COCOON 1995: 235-243 |
| 5 | | Alan Roberts,
Antonios Symvonis,
Louxin Zhang:
Routing on Trees via Matchings.
WADS 1995: 251-262 |
| 4 | EE | Louxin Zhang:
On the Approximation of Longest Common Nonsupersequences and Shortest Common Nonsubsequences.
Theor. Comput. Sci. 143(2): 353-362 (1995) |
| 1993 |
|---|
| 3 | | Klaus Madlener,
Paliath Narendran,
Friedrich Otto,
Louxin Zhang:
On Weakly Confluent Monadic String-Rewriting Systems.
Theor. Comput. Sci. 113(1): 119-165 (1993) |
| 1992 |
|---|
| 2 | | Louxin Zhang:
The Pre-NTS Property is Undecidable for Context-Free Grammars.
Inf. Process. Lett. 44(4): 181-184 (1992) |
| 1991 |
|---|
| 1 | | Friedrich Otto,
Louxin Zhang:
Decision Problems for Finite Special String-Rewriting Systems that are Confluent on Some Congruence Class.
Acta Inf. 28(5): 477 (1991) |
