Henry C. M. Leung Vis

Henry Chi-Ming Leung

*	2009
17	EE	Francis Y. L. Chin, Henry C. M. Leung, Wei-Lin Li, Siu-Ming Yiu: Finding optimal threshold for correction error reads in DNA assembling. BMC Bioinformatics 10(S-1): (2009)
16	EE	Henry Chi-Ming Leung, Man-Hung Siu, Siu-Ming Yiu, Francis Yuk-Lun Chin, Ken Wing-Kin Sung: Clustering-Based Approach for Predicting Motif Pairs from protein Interaction Data. J. Bioinformatics and Computational Biology 7(4): 701-716 (2009)
	2008
15	EE	Francis Y. L. Chin, Henry C. M. Leung, Man-Hung Siu, Siu-Ming Yiu: Optimal Algorithm for Finding DNA Motifs with Nucleotide Adjacent Dependency. APBC 2008: 343-352
14	EE	Francis Y. L. Chin, Henry C. M. Leung: DNA Motif Representation with Nucleotide Dependency. IEEE/ACM Trans. Comput. Biology Bioinform. 5(1): 110-119 (2008)
	2007
13	EE	Henry C. M. Leung, Francis Y. L. Chin, Bethany Man-Yee Chan: Discovering Motifs With Transcription Factor Domain Knowledge. Pacific Symposium on Biocomputing 2007: 472-483
12	EE	Francis Y. L. Chin, Henry C. M. Leung, Wing-Kin Sung, Siu-Ming Yiu: The Point Placement Problem on a Line - Improved Bounds for Pairwise Distance Queries. WABI 2007: 372-382
	2006
11	EE	Francis Y. L. Chin, Henry C. M. Leung: An Efficient Algorithm for String Motif Discovery. APBC 2006: 79-88
10		Henry C. M. Leung, Francis Y. L. Chin: Discovering DNA Motifs with Nucleotide Dependency. BIBE 2006: 70-80
9	EE	Henry C. M. Leung, Francis Y. L. Chin: Finding motifs from all sequences with and without binding sites. Bioinformatics 22(18): 2217-2223 (2006)
8	EE	Henry C. M. Leung, Francis Y. L. Chin: An efficient motif discovery algorithm with unknown motif length and number of binding sites. IJDMB 1(2): 201-215 (2006)
7	EE	Henry C. M. Leung, Francis Y. L. Chin: Algorithms for Challenging Motif Problems. J. Bioinformatics and Computational Biology 4(1): 43-58 (2006)
	2005
6	EE	Francis Y. L. Chin, Henry C. M. Leung: Voting algorithms for discovering long motifs. APBC 2005: 261-271
5	EE	Henry C. M. Leung, Francis Y. L. Chin: An Efficient Algorithm for the Extended (l, d)-Motif Problem with Unknown Number of Binding Sites. BIBE 2005: 11-18
4	EE	Henry C. M. Leung, Francis Y. L. Chin: Finding exact optimal motifs in matrix representation by partitioning. ECCB/JBI 2005: 92
3	EE	Henry C. M. Leung, Francis Y. L. Chin: Generalized Planted (l, d)-Motif Problem with Negative Set. WABI 2005: 264-275
2	EE	Henry C. M. Leung, Francis Y. L. Chin, Siu-Ming Yiu, Ronald Rosenfeld, Wai Wan Tsang: Finding Motifs with Insufficient Number of Strong Binding Sites. Journal of Computational Biology 12(6): 686-701 (2005)
	2004
1	EE	Francis Y. L. Chin, Henry C. M. Leung, Siu-Ming Yiu, Tak Wah Lam, Roni Rosenfeld, Wai Wan Tsang, David K. Smith, Y. Jiang: Finding motifs for insufficient number of sequences with strong binding to transcription facto. RECOMB 2004: 125-132

Coauthor Index

1	Bethany Man-Yee Chan	[13]
2	Francis Y. L. Chin (Francis Yuk-Lun Chin)	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17]
3	Y. Jiang	[1]
4	Tak Wah Lam	[1]
5	Wei-Lin Li	[17]
6	Ronald Rosenfeld (Roni Rosenfeld)	[1] [2]
7	Man-Hung Siu	[15] [16]
8	David K. Smith	[1]
9	Wing-Kin Sung (Ken Wing-Kin Sung)	[12] [16]
10	Wai Wan Tsang	[1] [2]
11	Siu-Ming Yiu	[1] [2] [12] [15] [16] [17]