Henry Chi-Ming, Leung

Department of Computer Science
University of Hong Kong
Hong Kong

Email: cmleung2@cs.hku.hk

Phone: (852) 2857 8465

BIOGRAPHY

Henry C.M. Leung got his PhD degree on Bioinformatics in the University of Hong Kong. His research interest is on the Motif Discovering Problem in DNA and protein sequences and the results have been published in various international conference and journals.

RESEARCH INTEREST

My research interest is in motif discovery. In order to decode set of genes for producing different proteins, a molecule called transcription factor has to bind to a short region (binding site) in the upstream of each of these genes. These binding sites should have the same length and similar pattern. The motif discovering problem is to find out the common pattern, motif, from the upstream of a set of co-expressed genes without knowledge of the positions of the binding sites.

PUBLICATIONS

Journal papers

• Francis Y.L. Chin, Henry C.M. Leung, Wei-Lin Li, S. M. Yiu. Finding optimal threshold for correction error reads in DNA assembling (2009) BMC Bioinformatics, 10(supp 1), S15.
  • Accepted by Asia-Pacific Bioinformatics Conference 2009 (APBC)
• Henry C.M. Leung, M.H. Siu, S.M. yiu, Francis Y.L. Chin, Ken W.K. Wong. A Clustering-Based Approach for Predicting Motif Pairs from Protein Interaction Data (2009) Journal of Bioinformatics and Computational Biology (JBCB) (to appear)
• Henry C.M. Leung, Qian Xiang, S.M. Yiu, Francis Chin. Predicting Protein Complexes from PPI Data: A Core-Attachment Approach (2009) Journal of Computational Biology (JCB), 16(2), page 133 - 144.
  • Accepted by the 4th Annual RECOMB Satellite on Systems Biology.
• Francis Y.L. Chin and Henry C.M. Leung. DNA Motif Representation with Nucleotide Dependency (2008) IEEE/ACM Transaction on Computational Biology and Bioinformatics, 5(1), page 110 - 119.
• Francis Y.L. Chin and Henry C.M. Leung. Finding motifs from all sequences with and without binding sites (2006) Bioinformatics, 22, page 2217 - 2223.
• Francis Y.L. Chin and Henry C.M. Leung. An efficient motif discovery algorithm with unknown motif length and number of binding sites (2006) International Journal of Data Mining and Bioinformatics (ijDMB), 1(2), page 201 - 215.
• Henry C.M. Leung and Francis Y.L. Chin. Algorithms for Challenging Motif Problems (2006) Journal of Bioinformatics and Computational Biology (JBCB), 4, pages 43 - 58. [pdf]
• Henry C.M. Leung, Francis Y.L. Chin, S.M. Yiu, Roni Rosenfeld and W.W. Tsang. Finding Motifs with Insufficient Number of Strong Binding Sites (2005) Journal of Computational Biology (JCB), 12(6), pages 686 - 701. [pdf]
• Henry C.M. Leung and Francis Y.L. Chin. Finding Exact Optimal Motif in Matrix Representation by Partitioning (2005) Bioinformatics, 22(supp 2), page ii86 - ii92. [pdf]
  • Published in Proceedings of European Conference of Computational Biology (ECCB)
  • Also published in Proceedings of the 7-th ACM Postgraduate Research Day.

Conference papers

• Francis Y.L. Chin, Henry C.M. Leung, M.H. Siu, S.M. Yiu. Optimal Algorithm for Finding DNA Motifs with Nucleotide Adjacent Dependency (2008) In Proceedings of Asia-Pacific Bioinformatics Conference (APBC), page 343 - 352.
• Henry C.M. Leung, M. H. Siu, S.M. Yiu, Francis Y.L. Chin and Ken W.K. Sung. Finding Linear Motif Pairs from Protein Interaction Networks: A probabilistic Approach (2007) Computational Systems Bioinformatics (CSB), page 111 - 120.
• Francsis Y.L. Chin. Henry C.M. Leung, Ken W.K. Sung and S.M. Yiu. The Point Placement Problem on a Line - Improved Bounds for Pairwise (2007) Lecture Notes in Computer Science, 4645, page 372 - 382.
  • Accepted by the 7th Workshop on Algorithms in Bioinformatics.
• Henry C.M. Leung, Francis Y.L. Chin and Bethany M.Y. Chan. Discovering Motifs with transcription factor Domain Knowledge (2007) In Proceedings of Pacific Symposium on Biocomputing (PSB), page 472 - 483.
• Francis Y.L. Chin and Henry C.M. Leung. Discovering DNA Motifs with Nucleotide Dependency (2006) In Proceedings of IEEE Symposium on Bioinformatics and Bioengineering (BIBE), page 70 - 77.
• Henry C.M. Leung and Francis Y.L. Chin. Redundancy Elimination in Motif Discovery Algorithms (2006) RECOMB Satellite Workshop on Regulatory Genomics, page 28 - 36.
• Francis Y.L. Chin and Henry C.M. Leung. An Efficient algorithm for String Motif Discovery (2006) In Proceedings of Asia-Pacific Bioinformatics Conference (APBC), page 79 - 88. [pdf]
• Henry C.M. Leung and Francis Y.L. Chin. An Efficient Algorithm for the Extended (l,d)-Motif Problem With Unknown Number of Binding Sites (2005) In Proceedings of IEEE Symposium on Bioinformatics and Bioengineering (BIBE), page 11 - 18.
• Invited to submit a journal version to International Journal of Data Mining and Bioinformatics (ijDMB). [pdf]
• Henry C.M. Leung and Francis Y.L. Chin. Generalized Planted (l,d)-Motif Problem with Negative Set (2005) LNCS: Proceedings of Workshop on Algorithms in Bioinformatics (WABI), pages 264 - 275. [pdf]
• Francis Y.L. Chin and Henry C.M. Leung. Voting Algorithms for Discovering Long Motifs (2005) In Proceedings of Asia-Pacific Bioinformatics Conference (APBC) pages 261 - 271. [pdf]
  • Also published in Proceedings of the 6-th ACM Postgraduate Research Day.
  • Invited to submit a journal version to a special issue in Journal of Bioinformatics and Computational Biology (JBCB).
• Francis Y.L. Chin, Henry C.M. Leung, S.M. Yiu, T.W. Lam, Roni Rosenfeld, W.W. Tsang, David K. Smith, Y. Jiang. Finding Motifs for Insufficient Number of Sequences with Strong Binding to Transcription Factor (2004) In Proceedings of Annual International Conference on Research in Computational Molecular Biology (RECOMB), pages 125 - 132. [pdf]
  • Invited to submit a journal version to Journal of Computational Biology (JCB).

SOFTWARE DEVELOPED

ALSE is a software package for finding motifs from two sets of sequences (containing and not containing binding sites), which is ready for public access http://alse.cs.hku.hk/. This website is on the first page when searching in google under the keyword "motif finding".