Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Leung, Henry C.M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Non-adaptive complex group testing with multiple positive sets
Francis Y.L. Chin
,
Henry C.M. Leung
,
S.M. Yiu
Theoretical Computer Science
505
, 2013, pp. 11-18
Deterministic polynomial-time algorithms for designing short DNA words
Ming-Yang Kao
,
Henry C.M. Leung
,
He Sun
,
Yong Zhang
Theoretical Computer Science
494
, 2013, pp. 144-160
IDBA-UD: A de novo assembler for single-cell and metagenomic sequencing data with highly uneven depth
Yu Peng
,
Henry C.M. Leung
,
S.M. Yiu
,
Francis Y.L. Chin
Bioinformatics
28
(11), 2012, pp. 1420-1428
MetaCluster 5.0: A two-round binning approach for metagenomic data for low-abundance species in a noisy sample
Yi Wang
,
Henry C.M. Leung
,
S.M. Yiu
,
Francis Y.L. Chin
Bioinformatics
28
(18), 2012, pp. 356-362
Adaptive phenotype testing for AND/OR items
Francis Y.L. Chin
,
Henry C.M. Leung
,
S.M. Yiu
Lecture Notes in Computer Science
7074
, 2011, pp. 754-763
A robust and accurate binning algorithm for metagenomic sequences with arbitrary species abundance ratio
Henry C.M. Leung
,
S.M. Yiu
,
Bin Yang
,
Yu Peng
,
Yi Wang
,
Zhihua Liu
,
Jingchi Chen
,
Junjie Qin
,
Ruiqiang Li
,
Francis Y.L. Chin
Bioinformatics
27
(11), 2011, pp. 1489-1495
Meta-IDBA: A de Novo assembler for metagenomic data
Yu Peng
,
Henry C.M. Leung
,
S.M. Yiu
,
Francis Y.L. Chin
Bioinformatics
27
(13), 2011, pp. 94-101
T-IDBA: A de novo iterative de Bruijn graph assembler for transcriptome
Yu Peng
,
Henry C.M. Leung
,
S.M. Yiu
,
Francis Y.L. Chin
LNCS/LNBI
6577
, 2011, pp. 337-338
IDBA - A practical iterative de Bruijn graph de novo assembler
Yu Peng
,
Henry C.M. Leung
,
S.M. Yiu
,
Francis Y.L. Chin
LNCS/LNBI
6044
, 2010, pp. 426-440
Finding motifs from all sequences with and without binding sites
Henry C.M. Leung
,
Francis Y.L. Chin
Bioinformatics
22
(18), 2006, pp. 2217-2223
Finding exact optimal motifs in matrix representation by partitioning
Henry C.M. Leung
,
Francis Y.L. Chin
Bioinformatics
21
(S2), 2005, pp. 86-92
Generalized planted
(l,d)
-motif problem with negative set
Henry C.M. Leung
,
Francis Y.L. Chin
LNCS/LNBI
3692
, 2005, pp. 264-275
Finding motifs for insufficient number of sequences with strong binding to transcription facto
Francis Y.L. Chin
,
Henry C.M. Leung
,
S.M. Yiu
,
T.W. Lam
,
Roni Rosenfeld
,
W.W. Tsang
,
David K. Smith
,
Y. Jiang
Proceedings of the 8th Annual International Conference on Research in Computational Molecular Biology, RECOMB'2004 (San Diego, CA, USA, March 27-31, 2004)
, 2004, pp. 125-132