The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Louxin Zhang: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  53. Run Probability of High-Order Seed Patterns and its Applications to Finding Good Transition Seeds. [Citation Graph (, )][DBLP]


  54. A Robust Method for Generating Discriminative Gene Clusters. [Citation Graph (, )][DBLP]


  55. Inferring the Recent Duplication History of a Gene Cluster. [Citation Graph (, )][DBLP]


  56. An Efficient Method for DNA-Based Species Assignment via Gene Tree and Species Tree Reconciliation. [Citation Graph (, )][DBLP]


  57. Approximating the Spanning k-Tree Forest Problem. [Citation Graph (, )][DBLP]


  58. A PTAS for the k-Consensus Structures Problem Under Euclidean Squared Distance. [Citation Graph (, )][DBLP]


Search in 0.038secs, Finished in 0.040secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002