| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. Louxin Zhang Ming Li , Bin Ma , Louxin Zhang: Superiority and complexity of the spaced seeds. SODA 2006 : 444-453 Jinsong Tan , Kok Seng Chua , Louxin Zhang: Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis. COCOON 2005 : 74-83 C. Thach Nguyen , Y. C. Tay , Louxin Zhang: Divide-and-conquer approach for the exemplar breakpoint distance. Bioinformatics 21 (10): 2171-2176 (2005) 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) Kwok Pui Choi , Fanfan Zeng , Louxin Zhang: Good Spaced Seeds For Homology Search. BIBE 2004 : 379-386 Jinsong Tan , Louxin Zhang: Approximation Algorithms for the Consecutive Ones Submatrix Problem on Sparse Matrices. ISAAC 2004 : 835-846 Guoliang Li , Tze-Yun Leong , Louxin Zhang: Translation Initiation Sites Prediction with Mixture Gaussian Models. WABI 2004 : 338-349 Kwok Pui Choi , Fanfan Zeng , Louxin Zhang: Good spaced seeds for homology search. Bioinformatics 20 (7): 1053-1059 (2004) Oscar H. Ibarra , Louxin Zhang: Computing And Combinatorics Conference -- Cocoon'02. Int. J. Found. Comput. Sci. 15 (1): 1 (2004) Kwok Pui Choi , Louxin Zhang: Sensitivity analysis and efficient method for identifying optimal spaced seeds. J. Comput. Syst. Sci. 68 (1): 22-40 (2004) Louxin Zhang, Bin Ma , Lusheng Wang , Ying Xu : Greedy method for inferring tandem duplication history. Bioinformatics 19 (12): 1497-1504 (2003) J. Kevin Lanctot , Ming Li , Bin Ma , Shaojiu Wang , Louxin Zhang: Distinguishing string selection problems. Inf. Comput. 185 (1): 41-55 (2003) Oscar H. Ibarra , Louxin Zhang: Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings Springer 2002 Louxin Zhang, Song Zhu : A New Clustering Method for Microarray Data Analysis. CSB 2002 : 268-275 Louxin Zhang, Bin Ma , Lusheng Wang : Efficient Methods for Inferring Tandem Duplication History. WABI 2002 : 97-111 Louxin Zhang, Song Zhu : Complexity Study on Two Clustering Problems. ISAAC 2001 : 660-669 Lusheng Wang , Kaizhong Zhang , Louxin Zhang: Perfect phylogenetic networks with recombination. SAC 2001 : 46-50 Louxin Zhang, Chew-Kiat Heng , Tin Wee Tan : Cladogramer: incorporating haplotype frequency into cladogram analysis. Bioinformatics 17 (5): 481-482 (2001) Lusheng Wang , Kaizhong Zhang , Louxin Zhang: Perfect Phylogenetic Networks with Recombination. Journal of Computational Biology 8 (1): 69-78 (2001) 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) Bin Ma , Ming Li , Louxin Zhang: From Gene Trees to Species Trees. SIAM J. Comput. 30 (3): 729-752 (2000) J. Kevin Lanctot , Ming Li , Bin Ma , Shaojiu Wang , Louxin Zhang: Distinguishing String Selection Problems. SODA 1999 : 633-642 Allison Lim , Louxin Zhang: WebPHYLIP: a web interface to PHYLIP. Bioinformatics 15 (12): 1068-1069 (1999) Ming Li , Louxin Zhang: Twist-Rotation Transformations of Binary Trees and Arithmetic Expressions. J. Algorithms 32 (2): 155-166 (1999) Bin Ma , Lusheng Wang , Louxin Zhang: Fitting Distances by Tree Metrics with Increment Error. J. Comb. Optim. 3 (2-3): 213-225 (1999) Louxin Zhang: Optimal Bounds for Matching Routing on Trees. SIAM J. Discrete Math. 12 (1): 64-77 (1999) Ming Li , Louxin Zhang: Better Approximation of Diagonal-Flip Transformation and Rotation Transformation. COCOON 1998 : 85-94 Bin Ma , Ming Li , Louxin Zhang: On reconstructing species trees from gene trees in term of duplications and losses. RECOMB 1998 : 182-191 Jing Chen , Limsoon Wong , Louxin Zhang: A Protein Patent Query System Powered By Kleisli. SIGMOD Conference 1998 : 593-595 Richard Beigel , William I. Gasarch , Ming Li , Louxin Zhang: Addition in log 2 n + O(1) Steps on Average: A Simple Analysis. Theor. Comput. Sci. 191 (1-2): 245-248 (1998) Danny Krizanc , Louxin Zhang: Many-to-One Packed Routing via Matchings. COCOON 1997 : 11-17 Bhaskar DasGupta , X. He , Tao Jiang , Ming Li , John Tromp , Louxin Zhang: On Distances between Phylogenetic Trees (Extended Abstract). SODA 1997 : 427-436 Louxin Zhang: Optimal Bounds for Matching Routing on Trees. SODA 1997 : 445-453 John Tromp , Louxin Zhang, Ying Zhao : Small Weight Bases for Hamming Codes. Theor. Comput. Sci. 181 (2): 337-345 (1997) Ming Li , John Tromp , Louxin Zhang: Some Notes on the Nearest Neighbour Interchange Distance. COCOON 1996 : 343-351 Richard Beigel , William I. Gasarch , Ming Li , Louxin Zhang: Addition in log 2 n + O(1) Steps on Average: A Simple Analysis Electronic Colloquium on Computational Complexity (ECCC) 3 (51): (1996) John Tromp , Louxin Zhang, Ying Zhao : Small Weight Bases for Hamming Codes. COCOON 1995 : 235-243 Alan Roberts , Antonios Symvonis , Louxin Zhang: Routing on Trees via Matchings. WADS 1995 : 251-262 Louxin Zhang: On the Approximation of Longest Common Nonsupersequences and Shortest Common Nonsubsequences. Theor. Comput. Sci. 143 (2): 353-362 (1995) Klaus Madlener , Paliath Narendran , Friedrich Otto , Louxin Zhang: On Weakly Confluent Monadic String-Rewriting Systems. Theor. Comput. Sci. 113 (1): 119-165 (1993) Louxin Zhang: The Pre-NTS Property is Undecidable for Context-Free Grammars. Inf. Process. Lett. 44 (4): 181-184 (1992) 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) 1 [ 7 ] [ 13 ] 2 [ 14 ] 3 [ 33 ] [ 35 ] [ 38 ] 4 [ 41 ] 5 [ 11 ] 6 [ 23 ] 7 [ 7 ] [ 13 ] 8 [ 11 ] 9 [ 25 ] 10 [ 30 ] [ 34 ] 11 [ 11 ] 12 [ 12 ] 13 [ 21 ] [ 31 ] 14 [ 36 ] [ 39 ] 15 [ 36 ] [ 39 ] 16 [ 7 ] [ 8 ] [ 11 ] [ 13 ] [ 15 ] [ 16 ] [ 19 ] [ 21 ] [ 22 ] [ 31 ] [ 42 ] 17 [ 20 ] 18 [ 15 ] [ 18 ] [ 21 ] [ 22 ] [ 28 ] [ 31 ] [ 32 ] [ 42 ] 19 [ 3 ] 20 [ 3 ] 21 [ 40 ] 22 [ 1 ] [ 3 ] 23 [ 5 ] 24 [ 5 ] 25 [ 37 ] [ 41 ] 26 [ 25 ] 27 [ 40 ] 28 [ 6 ] [ 8 ] [ 9 ] [ 11 ] 29 [ 18 ] [ 24 ] [ 26 ] [ 28 ] [ 32 ] 30 [ 21 ] [ 31 ] 31 [ 14 ] 32 [ 32 ] 33 [ 35 ] [ 38 ] 34 [ 24 ] [ 26 ] 35 [ 6 ] [ 9 ] 36 [ 27 ] [ 29 ]  ©2006 Association for Computing Machinery |
