Henry C. M. Leung

According to our database1, Henry C. M. Leung authored at least 54 papers between 2004 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
MegaPath-Nano: Accurate Compositional Analysis and Drug-level Antimicrobial Resistance Detection Software for Oxford Nanopore Long-read Metagenomics.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2020

2019
A powerful conditional gene-based association approach implicated functionally important genes for schizophrenia.
Bioinform., 2019

RENET: A Deep Learning Approach for Extracting Gene-Disease Associations from Literature.
Proceedings of the Research in Computational Molecular Biology, 2019

2018
AC-DIAMOND v1: accelerating large-scale DNA-protein alignment.
Bioinform., 2018

MegaPath: Low-Similarity Pathogen Detection from Metagenomic NGS Data (Extended Abstract).
Proceedings of the 8th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2018

2017
MegaGTA: a sensitive and accurate metagenomic gene-targeted assembler using iterative de Bruijn graphs.
BMC Bioinform., 2017

Mixed Membership Sparse Gaussian Conditional Random Fields.
Proceedings of the Advanced Data Mining and Applications - 13th International Conference, 2017

2016
AC-DIAMOND: Accelerating Protein Alignment via Better SIMD Parallelization and Space-Efficient Indexing.
Proceedings of the Bioinformatics and Biomedical Engineering, 2016

2015
IDBA-MTP: A Hybrid Metatranscriptomic Assembler Based on Protein Information.
J. Comput. Biol., 2015

misFinder: identify mis-assemblies in an unbiased manner using reference and paired-end reads.
BMC Bioinform., 2015

2014
MetaCluster-TA: taxonomic annotation for metagenomic data based on assembly-assisted binning.
BMC Genom., 2014

Learning Sparse Gaussian Bayesian Network Structure by Variable Grouping.
Proceedings of the 2014 IEEE International Conference on Data Mining, 2014

Predicting drug-target interaction for new drugs using enhanced similarity measures and super-target clustering<sup>1</sup>.
Proceedings of the 2014 IEEE International Conference on Bioinformatics and Biomedicine, 2014

2013
Deterministic polynomial-time algorithms for designing short DNA words.
Theor. Comput. Sci., 2013

Non-adaptive complex group testing with multiple positive sets.
Theor. Comput. Sci., 2013

IDBA-MT: <i>De Novo</i> Assembler for Metatranscriptomic Data Generated from Next-Generation Sequencing Technology.
J. Comput. Biol., 2013

IDBA-tran: a more robust de novo de Bruijn graph assembler for transcriptomes with uneven expression levels.
Bioinform., 2013

Reconstructing <i>k</i>-Reticulated Phylogenetic Network from a Set of Gene Trees.
Proceedings of the Bioinformatics Research and Applications, 9th International Symposium, 2013

Intra- and inter-sparse multiple output regression with application on environmental microbial community study.
Proceedings of the 2013 IEEE International Conference on Bioinformatics and Biomedicine, 2013

PERGA: A Paired-End Read Guided De Novo Assembler for Extending Contigs Using SVM Approach.
Proceedings of the ACM Conference on Bioinformatics, 2013

2012
MetaCluster 4.0: A Novel Binning Algorithm for NGS Reads and Huge Number of Species.
J. Comput. Biol., 2012

MetaCluster 5.0: a two-round binning approach for metagenomic data for low-abundance species in a noisy sample.
Bioinform., 2012

IDBA-UD: a <i>de novo</i> assembler for single-cell and metagenomic sequencing data with highly uneven depth.
Bioinform., 2012

Phylogenetic Tree Reconstruction with Protein Linkage.
Proceedings of the Bioinformatics Research and Applications - 8th International Symposium, 2012

2011
Meta-IDBA: a <i>de Novo</i> assembler for metagenomic data.
Bioinform., 2011

A robust and accurate binning algorithm for metagenomic sequences with arbitrary species abundance ratio.
Bioinform., 2011

T-IDBA: A de novo Iterative de Bruijn Graph Assembler for Transcriptome - (Extended Abstract).
Proceedings of the Research in Computational Molecular Biology, 2011

Adaptive Phenotype Testing for AND/OR Items.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

DMPFinder - Finding Differentiating Pathways with Gaps from Two Groups of Metabolic Networks.
Proceedings of the ISCA 3rd International Conference on Bioinformatics and Computational Biology, 2011

2010
Unsupervised binning of environmental genomic fragments based on an error robust selection of <i>l</i>-mers.
BMC Bioinform., 2010

IDBA - A Practical Iterative de Bruijn Graph De Novo Assembler.
Proceedings of the Research in Computational Molecular Biology, 2010

Predicting metabolic pathways from metabolic networks with limited biological knowledge.
Proceedings of the 2010 IEEE International Conference on Bioinformatics and Biomedicine Workshops, 2010

MetaCluster: unsupervised binning of environmental genomic fragments and taxonomic annotation.
Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology, 2010

2009
Predicting Protein Complexes from PPI Data: A Core-Attachment Approach.
J. Comput. Biol., 2009

Clustering-Based Approach for Predicting Motif Pairs from protein Interaction Data.
J. Bioinform. Comput. Biol., 2009

Finding optimal threshold for correction error reads in DNA assembling.
BMC Bioinform., 2009

Unsupervised binning of environmental genomic fragments based on an error robust selection of l-mers.
Proceedings of the Proceeding of the 3rd International Workshop on Data and Text Mining in Bioinformatics, 2009

2008
DNA Motif Representation with Nucleotide Dependency.
IEEE ACM Trans. Comput. Biol. Bioinform., 2008

Optimal Algorithm for Finding DNA Motifs with Nucleotide Adjacent Dependency.
Proceedings of the 6th Asia-Pacific Bioinformatics Conference, 2008

2007
The Point Placement Problem on a Line - Improved Bounds for Pairwise Distance Queries.
Proceedings of the Algorithms in Bioinformatics, 7th International Workshop, 2007

Discovering Motifs With Transcription Factor Domain Knowledge.
Proceedings of the Biocomputing 2007, 2007

2006
Motif discovery for DNA sequences
PhD thesis, 2006

Changes in effective connectivity during incidental and intentional perception of fearful faces.
NeuroImage, 2006

Algorithms for Challenging Motif Problems.
J. Bioinform. Comput. Biol., 2006

An efficient motif discovery algorithm with unknown motif length and number of binding sites.
Int. J. Data Min. Bioinform., 2006

Finding motifs from all sequences with and without binding sites.
Bioinform., 2006

Discovering DNA Motifs with Nucleotide Dependency.
Proceedings of the Sixth IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2006), 2006

An Efficient Algorithm for String Motif Discovery.
Proceedings of 4th Asia-Pacific Bioinformatics Conference. 13-16 February 2006, 2006

2005
Finding Motifs with Insufficient Number of Strong Binding Sites.
J. Comput. Biol., 2005

Generalized Planted (<i>l</i>, <i>d</i>)-Motif Problem with Negative Set.
Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005

Finding exact optimal motifs in matrix representation by partitioning.
Proceedings of the ECCB/JBI'05 Proceedings, Fourth European Conference on Computational Biology/Sixth Meeting of the Spanish Bioinformatics Network (Jornadas de BioInformática), Palacio de Congresos, Madrid, Spain, September 28, 2005

An Efficient Algorithm for the Extended (l, d)-Motif Problem with Unknown Number of Binding Sites.
Proceedings of the Fifth IEEE International Symposium on Bioinformatic and Bioengineering (BIBE 2005), 2005

Voting algorithms for discovering long motifs.
Proceedings of 3rd Asia-Pacific Bioinformatics Conference, 17-21 January 2005, Singapore, 2005

2004
Finding motifs for insufficient number of sequences with strong binding to transcription facto.
Proceedings of the Eighth Annual International Conference on Computational Molecular Biology, 2004


  Loading...