- Minimum Manhattan Network is NP-Complete Francis Y. L. Chin
- Minimum Parent-Offspring Recombination Haplotype Inference in Pedigrees
- PROCEEDINGS Open Access Unsupervised binning of environmental
- Linear-Time Haplotype Inference on Pedigrees without Recombinations and Mating Loops
- O#line Algorithms for Minimizing Total Flow Time in Broadcast Scheduling
- Improved On-line Broadcast Scheduling with Feifeng Zheng1
- Efficient Methods for Multiple Sequence Alignment with Guaranteed Error Bounds (1993; Gusfield)
- BioMed Central Page 1 of 8
- JOURNAL OF COMPUTATIONAL BIOLOGY Volume 16, Number 2, 2009
- AUTHOR'SPROOF Journal ID: 453, Article ID: 9241, Date: 2008-10-13, Proof No: 1
- Discrete Comput Geom (2011) 45: 701722 DOI 10.1007/s00454-011-9342-z
- Oxford University Press 2005 1 Meta-IDBA: A de Novo Assembler for Metagenomic Data
- Online Uniformly Inserting Points on Grid Yong Zhang1
- Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs
- MetaCluster: Unsupervised Binning of Environmental Genomic Fragments and Taxonomic Annotation
- Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing
- DMPFinder -Finding differentiating pathways with gaps from two groups of metabolic networks* Henry C.M. Leung
- Journal of Bioinformatics and Computational Biology Vol. 3, No. 1 (2005) 118
- JOURNAL OF COMPUTATIONAL BIOLOGY Volume 12, Number 6, 2005
- Computational Geometry 32 (2005) 112 www.elsevier.com/locate/comgeo
- ALGORITHMS FOR CHALLENGING MOTIF PROBLEMS HENRY C.M. LEUNG AND FRANCIS Y.L. CHIN
- Int. J. Data Mining and Bioinformatics, Vol. x, No. x, xxxx 1 Copyright 200x Inderscience Enterprises Ltd.
- Vol. 22 no. 18 2006, pages 22172223 doi:10.1093/bioinformatics/btl371BIOINFORMATICS ORIGINAL PAPER
- VOTING ALGORITHMS FOR DISCOVERING LONG MOTIFS FRANCIS Y.L. CHIN AND HENRY C.M. LEUNG
- Placement Solutions for Multiple Versions of A Multimedia Object Keqiu Li, Hong Shen
- V.S. Sunderam et al. (Eds.): ICCS 2005, LNCS 3515, pp. 985 993, 2005. Springer-Verlag Berlin Heidelberg 2005
- Cooperative Determination on Cache Replacement Candidates
- Generalized Planted (l,d)-Motif Problem with Negative Set
- Laxity Helps in Broadcast Scheduling Stanley P.Y. Fung1
- REDUNDANCY ELIMINATION IN MOTIF DISCOVERY HENRY LEUNG AND FRINCIS CHIN
- DISCOVERING MOTIFS WITH TRANSCRIPTION FACTOR DOMAIN KNOWLEDGE*
- Online OVSF Code Assignment with Resource Augmentation
- Online Tree Node Assignment with Resource Augmentation
- Online Frequency Allocation in Cellular Networks Joseph Wun-Tat Chan
- FINDING LINEAR MOTIF PAIRS FROM PROTEIN INTERACTION NETWORKS: A PROBABILISTIC APPROACH
- Finding Motifs for Insufficient Number of Sequences with Strong Binding to Transcription Factor
- Minimum Manhattan Network is NP-Complete Francis Y. L. Chin
- OPTIMAL ALGORITHM FOR FINDING DNA MOTIFS WITH NUCLEOTIDE ADJACENT DEPENDENCY
- Algorithmica (2009) 54: 557567 DOI 10.1007/s00453-008-9203-1
- This article was published in an Elsevier journal. The attached copy is furnished to the author for non-commercial research and
- Optimal Methods for Coordinated Enroute Web Caching for Tree Networks
- Online Frequency Assignment in Wireless Communication Networks
- On Hamiltonian Tetrahedralizations Of Convex Francis Chin 1 , QingHuai Ding 2 , and Cao An Wang 3
- J Comb Optim (2006) 11: 177187 DOI 10.1007/s10878-006-7128-7
- AN EFFICIENT ALGORITHM FOR STRING MOTIF DISCOVERY FRANCIS Y.L. CHIN AND HENRY C.M. LEUNG
- Construction of the Nearest Neighbor Embracing Graph of a Point M.Y. Chan 1 , Danny Z. Chen 2 , Francis Y.L. Chin 1 , and Cao An Wang 3
- Online Bin Packing of Fragile Objects with Application in Cellular Networks
- Variable-Size Rectangle Covering Francis Y.L. Chin , Hing-Fung Ting and Yong Zhang
- A Simple Algorithm for the Constrained Sequence Problems
- Multimedia Object Placement for Hybrid Transparent Data Replication , Hong Shen 1,2
- Greedy Online Frequency Allocation in Cellular Networks Wun-Tat Chan
- An Efficient Algorithm for the Extended (l,d)-Motif Problem With Unknown Number of Binding Sites
- EXPLICIT CONTOUR MODEL FOR VEHICLE TRACKING WITH AUTOMATIC HYPOTHESIS VALIDATION
- Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks
- IDBA -A Practical Iterative de Bruijn Graph De Novo Yu Peng, Henry C.M. Leung, S.M. Yiu, Francis Y.L. Chin
- Linear-Time Haplotype Inference on Pedigrees without Recombinations
- DNA Motif Representation with Nucleotide Dependency
- Dynamic Offline Conflict-Free Coloring for Unit Joseph Wun-Tat Chan1
- Real-time Multiple Head Shape Detection and Tracking System with Decentralized Trackers
- An Efficient Cache Replacement Algorithm for Multimedia Object Caching
- Finding Motifs Computationally Francis Y.L. Chin
- A clique-based algorithm for constructing feasible timetables Yongkai Liu, Defu Zhang and Francis Y.L. Chin
- SHADOW DETECTION FOR VEHICLES BY LOCATING THE OBJECT-SHADOW BOUNDARY
- A Tight Lower Bound for Job Scheduling with Cancellation #
- Non-Adaptive Complex Group Testing with Multiple Positive Sets
- Adaptive Phenotype Testing for AND/OR Items Francis Y.L. Chin Henry C.M. Leung S.M. Yiu
- Competitive Algorithms for Online Pricing Yong Zhang1,2,
- Online Call Control in Cellular Networks Revisited Francis Y.L. Chin
- Online Algorithms for 1-Space Bounded Multi Dimensional Bin Packing and Hypercube Packing
- MetaCluster 4.0: A Novel Binning Algorithm for NGS Reads and Huge Number of Species
