Search results for "Henry C. M. Leung"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Ming-Yang Kao, Henry C. M. Leung, He Sun, Yong Zhang	Deterministic Polynomial-Time Algorithms for Designing Short DNA Words	CoRR	2012	DBLP BibTeX RDF
1	Junjie Yu, Henry Chi-Ming Leung, Siu-Ming Yiu, Yong Zhang, Francis Y. L. Chin, Nathan Hobbs, Amy Y. X. Wang	Phylogenetic Tree Reconstruction with Protein Linkage.	ISBRA	2012	DBLP DOI BibTeX RDF
1	Henry C. M. Leung, Siu-Ming Yiu, Bin Yang, Yu Peng, Yi Wang, Zhihua Liu, Jing-Chi Chen, Junjie Qin, Ruiqiang Li, Francis Y. L. Chin	A robust and accurate binning algorithm for metagenomic sequences with arbitrary species abundance ratio.	Bioinformatics	2011	DBLP DOI BibTeX RDF
1	Yu Peng, Henry C. M. Leung, Siu-Ming Yiu, Francis Y. L. Chin	Meta-IDBA: a de Novo assembler for metagenomic data.	Bioinformatics [ISMB/ECCB]	2011	DBLP DOI BibTeX RDF
1	Francis Y. L. Chin, Henry C. M. Leung, Siu-Ming Yiu	Non-adaptive Complex Group Testing with Multiple Positive Sets.	TAMC	2011	DBLP DOI BibTeX RDF
1	Yu Peng, Henry C. M. Leung, Siu-Ming Yiu, Francis Y. L. Chin	T-IDBA: A de novo Iterative de Bruijn Graph Assembler for Transcriptome - (Extended Abstract).	RECOMB	2011	DBLP DOI BibTeX RDF
1	Francis Y. L. Chin, Henry C. M. Leung, Siu Ming Yiu	Adaptive Phenotype Testing for AND/OR Items.	ISAAC	2011	DBLP DOI BibTeX RDF
1	Henry Chi-Ming Leung, Shuen-Yi Leung, Carlos Lu Xiang, Siu-Ming Yiu, Francis Yuk-Lun Chin	DMPFinder - Finding Differentiating Pathways with Gaps from Two Groups of Metabolic Networks.	BICoB	2011	DBLP BibTeX RDF
1	Ming-Yang Kao, Henry C. M. Leung, He Sun, Yong Zhang	Deterministic Polynomial-Time Algorithms for Designing Short DNA Words.	TAMC	2010	DBLP DOI BibTeX RDF
1	Yu Peng, Henry C. M. Leung, Siu-Ming Yiu, Francis Y. L. Chin	IDBA - A Practical Iterative de Bruijn Graph De Novo Assembler.	RECOMB	2010	DBLP DOI BibTeX RDF
1	Bin Yang, Yu Peng, Henry C. M. Leung, Siu-Ming Yiu, Junjie Qin, Ruiqiang Li, Francis Y. L. Chin	MetaCluster: unsupervised binning of environmental genomic fragments and taxonomic annotation.	BCB	2010	DBLP DOI BibTeX RDF
1	Bin Yang, Yu Peng, Henry Chi-Ming Leung, Siu-Ming Yiu, Jing-Chi Chen, Francis Yuk-Lun Chin	Unsupervised binning of environmental genomic fragments based on an error robust selection of l-mers.	BMC Bioinformatics	2010	DBLP DOI BibTeX RDF
1	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	2009	DBLP DOI BibTeX RDF
1	Bin Yang, Yu Peng, Henry C. M. Leung, Siu-Ming Yiu, Jing-Chi Chen, Francis Y. L. Chin	Unsupervised binning of environmental genomic fragments based on an error robust selection of l-mers.	DTMBIO	2009	DBLP DOI BibTeX RDF	dna composition features, k-mer, modified chebychev distance, k-mean clustering, metagenomics, binning
1	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	2009	DBLP DOI BibTeX RDF
1	Francis Y. L. Chin, Henry C. M. Leung	DNA Motif Representation with Nucleotide Dependency.	IEEE/ACM Trans. Comput. Biology Bioinform.	2008	DBLP DOI BibTeX RDF	Pattern Recognition, Design Methodology, Pattern analysis, Computing Methodologies
1	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	DBLP BibTeX RDF
1	Henry C. M. Leung, Francis Y. L. Chin, Bethany Man-Yee Chan	Discovering Motifs With Transcription Factor Domain Knowledge.	Pacific Symposium on Biocomputing	2007	DBLP BibTeX RDF
1	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	DBLP DOI BibTeX RDF
1	Henry C. M. Leung, Francis Y. L. Chin	Finding motifs from all sequences with and without binding sites.	Bioinformatics	2006	DBLP DOI BibTeX RDF
1	Henry C. M. Leung, Francis Y. L. Chin	Algorithms for Challenging Motif Problems.	J. Bioinformatics and Computational Biology	2006	DBLP DOI BibTeX RDF
1	Henry C. M. Leung, Francis Y. L. Chin	An efficient motif discovery algorithm with unknown motif length and number of binding sites.	IJDMB	2006	DBLP DOI BibTeX RDF
1	Francis Y. L. Chin, Henry C. M. Leung	An Efficient Algorithm for String Motif Discovery.	APBC	2006	DBLP BibTeX RDF
1	Henry C. M. Leung, Francis Y. L. Chin	Discovering DNA Motifs with Nucleotide Dependency.	BIBE	2006	DBLP BibTeX RDF
1	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	2005	DBLP DOI BibTeX RDF
1	Henry C. M. Leung, Francis Y. L. Chin	Finding exact optimal motifs in matrix representation by partitioning.	ECCB/JBI	2005	DBLP DOI BibTeX RDF
1	Francis Y. L. Chin, Henry C. M. Leung	Voting algorithms for discovering long motifs.	APBC	2005	DBLP BibTeX RDF
1	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	DBLP DOI BibTeX RDF
1	Henry C. M. Leung, Francis Y. L. Chin	Generalized Planted (l, d)-Motif Problem with Negative Set.	WABI	2005	DBLP DOI BibTeX RDF
1	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	DBLP DOI BibTeX RDF	binding energy, DNA microarray, transcription factor, motif finding

Publications of Henry C. M. Leung Henry Chi-Ming Leung ( http://dblp.L3S.de/Authors/Henry_C._M._Leung )