Journal

J. Zheng, J. Svensson, Kavitha Madishetty, T. Close, T. Jiang, S. Lonardi. OligoSpawn: a software tool for the design of overgo probes from large unigene databases. BMC Bioinformatics, 7:7, 2006.

A. Goldstein, P. Kolman, J. Zheng. Minimum common string partition problem: hardness and approximation. Electronic Journal of Combinatorics, vol. 12(1), 2005.

X. Chen, J. Zheng, Z. Fu, P. Nan, Y. Zhong, S. Lonardi and T. Jiang. Assignment of orthologous genes via genome rearrangement. IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), vol. 2, no. 4, pp. 302-315, 2005.

J. Zheng, T. Close, T. Jiang, S. Lonardi. Efficient Selection of Unique and Popular Oligos for Large EST Databases. Bioinformatics, vol. 20, no. 13, pp. 2101-2112, 2004.

Conference

J. Zheng, S. Lonardi. Discovery of repetitive patterns in DNA with accurate boundaries. Proc. of IEEE International Symposium on BioInformatics and BioEngineering (BIBE'05), pp. 105-112, Minneapolis, Minnesota, USA, 2005.

X. Chen, J. Zheng, Z. Fu, P. Nan, Y. Zhong, S. Lonardi and T. Jiang. Assignment of orthologous genes via genome rearrangement. Proc. of Asia-Pacific Bioinformatics Conference (APBC'05), pp. 363-378, Singapore, 2005.

A. Goldstein, P. Kolman, J. Zheng. Minimum common string partition problem: hardness and approximation. Proc. of International Symposium on Algorithms and Computation (ISAAC'04), pp. 484-495, LNCS 3341, Hong Kong, China, 2004.

J. Zheng, T. Close, T. Jiang, S. Lonardi. Efficient Selection of Unique and Popular Oligos for Large EST Databases. Proc. of Symposium on Combinatorial Pattern Matching (CPM'03), pp. 384-401, LNCS 2676, Morelia, Mexico, 2003.