
This project deals with "fragment assembly" algorithms for a common task in bioinformatics: DNA sequencing. It can be modeled as combinatorial problems involving graph theoretical results and Multiple Sequence Alignment. The goal is to improve one particular method called "Eulerian Superpath", by refining the error correction procedure which proved to be central to performance of Eulerian Superpath.
 |
Partial result was presented at RECOMB '07 as a poster paper.
Reference:
Jia Zheng, Hon Wai Leong and Haixu Tang. An Improved Algorithm for Error Correction in Reads for Fragment Assembly. (poster paper) Intl Conference on Research in Computational Molecular Biology (RECOMB-2007), San Francisco, Apr 2007.
|
 |
It received NUS Outstanding Undergraduate Researcher Prize in 2007. |
Download Paper
|