( en | de | ru )

 

Disambiguation of "Leung, Henry C. M."

Author of the publication

copydeleteadd this publication to your clipboard
Finding optimal threshold for correction error reads in DNA assembling.

, , , and . BMC Bioinform., (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Raymond Leung

Michaela Karin Ingrid Henry

Madeleine Mary Henry

James Henry

David P Henry

 

Other publications of authors with the same name

Discovering Motifs With Transcription Factor Domain Knowledge., , and . Pacific Symposium on Biocomputing, page 472-483. World Scientific, (2007)An Efficient Algorithm for String Motif Discovery., and . APBC, page 79-88. Imperial College Press, London, (2006)Deterministic Polynomial-Time Algorithms for Designing Short DNA Words, , , and . CoRR, (2012)Motif discovery for DNA sequences. University of Hong Kong, (2006)Generalized Planted (l, d)-Motif Problem with Negative Set., and . WABI, volume 3692 of Lecture Notes in Computer Science, page 264-275. Springer, (2005)The Point Placement Problem on a Line - Improved Bounds for Pairwise Distance Queries., , , and . WABI, volume 4645 of Lecture Notes in Computer Science, page 372-382. Springer, (2007)Non-adaptive Complex Group Testing with Multiple Positive Sets., , and . TAMC, volume 6648 of Lecture Notes in Computer Science, page 172-183. Springer, (2011)IDBA-MT: De Novo Assembler for Metatranscriptomic Data Generated from Next-Generation Sequencing Technology., , , and . J. Comput. Biol., 20 (7): 540-550 (2013)Voting algorithms for discovering long motifs., and . APBC, page 261-271. Imperial College Press, London, (2005)Non-adaptive complex group testing with multiple positive sets., , and . Theor. Comput. Sci., (2013)