Search the dblp DataBase

Publications of Author

1. Francis Y. L. Chin, Henry C. M. Leung
   Voting algorithms for discovering long motifs. [Citation Graph (0, 0)][DBLP]
   APBC, 2005, pp:261-271 [Conf]
   
2. Francis Y. L. Chin, Henry C. M. Leung
   An Efficient Algorithm for String Motif Discovery. [Citation Graph (0, 0)][DBLP]
   APBC, 2006, pp:79-88 [Conf]
   
3. Henry C. M. Leung, Francis Y. L. Chin
   An Efficient Algorithm for the Extended (l, d)-Motif Problem with Unknown Number of Binding Sites. [Citation Graph (0, 0)][DBLP]
   BIBE, 2005, pp:11-18 [Conf]
   
4. Henry C. M. Leung, Francis Y. L. Chin
   Discovering DNA Motifs with Nucleotide Dependency. [Citation Graph (0, 0)][DBLP]
   BIBE, 2006, pp:70-80 [Conf]
   
5. Henry C. M. Leung, Francis Y. L. Chin
   Finding exact optimal motifs in matrix representation by partitioning. [Citation Graph (0, 0)][DBLP]
   ECCB/JBI, 2005, pp:92- [Conf]
   
6. 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. [Citation Graph (0, 0)][DBLP]
   RECOMB, 2004, pp:125-132 [Conf]
   
7. Henry C. M. Leung, Francis Y. L. Chin
   Generalized Planted (l, d)-Motif Problem with Negative Set. [Citation Graph (0, 0)][DBLP]
   WABI, 2005, pp:264-275 [Conf]
   
8. Henry C. M. Leung, Francis Y. L. Chin
   Finding motifs from all sequences with and without binding sites. [Citation Graph (0, 0)][DBLP]
   Bioinformatics, 2006, v:22, n:18, pp:2217-2223 [Journal]
   
9. Henry C. M. Leung, Francis Y. L. Chin
   Algorithms for Challenging Motif Problems. [Citation Graph (0, 0)][DBLP]
   J. Bioinformatics and Computational Biology, 2006, v:4, n:1, pp:43-58 [Journal]
   
10. 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. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2005, v:12, n:6, pp:686-701 [Journal]
    
11. Francis Y. L. Chin, Henry C. M. Leung, W. K. Sung, Siu-Ming Yiu
    The Point Placement Problem on a Line - Improved Bounds for Pairwise Distance Queries. [Citation Graph (0, 0)][DBLP]
    WABI, 2007, pp:372-382 [Conf]
    
12. 
    Optimal Algorithm for Finding DNA Motifs with Nucleotide Adjacent Dependency. [Citation Graph (, )][DBLP]
    
    
13. 
    Unsupervised binning of environmental genomic fragments based on an error robust selection of l-mers. [Citation Graph (, )][DBLP]
    
    
14. 
    Discovering Motifs With Transcription Factor Domain Knowledge. [Citation Graph (, )][DBLP]
    
    
15. 
    IDBA - A Practical Iterative de Bruijn Graph De Novo Assembler. [Citation Graph (, )][DBLP]
    
    
16. 
    Deterministic Polynomial-Time Algorithms for Designing Short DNA Words. [Citation Graph (, )][DBLP]
    
    
17. 
    Finding optimal threshold for correction error reads in DNA assembling. [Citation Graph (, )][DBLP]