Y. L. Chin - Publications

Publications

• Henry Leung and Francis Chin, "Finding Exact Optimal Motif in Matrix Representation by Partitioning", Proceedings of the 4th European Conference on Computational Biology (ECCB05), (Oct /Nov 2005) (accepted) also to be appeared in Bioinformatics
• Henry Leung and Francis Y.L. Chin, "Generalized Planted (l,d)-Motif Problem with Negative Set", Proceedings of the 5th Workshop on Algorithms in Bioinformatics (WABI 2005), (October 2005) (accepted)
• Francis Y.L. Chin and Henry C.M. Leung, "Voting Algorithms for Discovering Long Motifs", Proceedings of the Third Asia-Pacific Bioinformatics Conference (APBC2005), 261-271 (January 2005)
• Francis Y.L. Chin, Qiangfeng Zhang and Hong Shen, "k-Recombination Haplotype Inference in Pedigrees", Proceedings of the 2005 International Workshop on Bioinformatics Research and Applications (in ICCS 2005), 985-993,(May 22–25, 2005)
• Qiangfeng Zhang, Francis Y.L. Chin and Hong Shen, "Minimum Parent-Offspring Recombination Haplotype Inference in Pedigrees", LNCS Transactions on Computational Systems Biology (to appear)
• Francis Y.L. Chin, N.L. Ho, T.W. Lam, and Prudence W.H. Wong, "Efficient Constrained Multiple Sequence Alignment with Performance Guarantee", Journal of Bioinformatics and Computational Biology, 3(1):1-18 (February 2005) - preliminary version appeared in CSB2003
• F.Y.L. Chin, H.C.M. Leung, S.M.Yiu, T.W. Lam, R. Rosenfeld, W.W. Tsang, D.K. Smith, Y. Jiang, Finding Motifs for Insufficient Number of Sequences with Strong Binding to Transcription Factor, Proceedings of the 8th Annual International Conference on Research in Computational Molecular Biology (RECOMB 2004), Westin Hotel Horton Plaza, San Diego, CA USA, March 2004
• W.T. Chan, F.Y.L. Chin, and H.F. Ting, Escaping a Grid by Edge-Disjoint Paths, Algorithmica 36:343-359, April 2003. Also appeared in the Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'00), San Francisco, USA, January 2000
• F.Y.L. Chin and S.P.Y. Fung, Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help?, Algorithmica, 37:149-164, August 2003
• F.Y.L. Chin and S.P.Y. Fung, Improved competitiveness algorithms for online scheduling with partial job values, The Ninth International Computing and Combinatorics Conference (COCOON 2003), Big Sky, MT, USA, pp. 425–434, July 2003