Please use this identifier to cite or link to this item: https://doi.org/10.1109/BIBE.2004.1317390
Title: A mutation-sensitive approach for locating conserved gene pairs between related species
Authors: Chan, H.L.
Lam, T.W.
Sung, W.K. 
Wong, P.W.H.
Yiu, S.M.
Keywords: Conserved gene pairs
Mutation
Whole genome alignment
Issue Date: 2004
Source: Chan, H.L., Lam, T.W., Sung, W.K., Wong, P.W.H., Yiu, S.M. (2004). A mutation-sensitive approach for locating conserved gene pairs between related species. Proceedings - Fourth IEEE Symposium on Bioinformatics and Bioengineering, BIBE 2004 : 545-552. ScholarBank@NUS Repository. https://doi.org/10.1109/BIBE.2004.1317390
Abstract: This paper proposes a new approach for solving the whole genome alignment problem. Our approach is based on a new structural optimization problem (called the MUM Selection Problem) related to mutations via reversals and transpositions. We have devised a practical algorithm for this optimization problem and have evaluated the algorithm using 15 pairs of human and mouse chromosomes. The results show that our algorithm is both effective and efficient. More specifically, our algorithm can reveal 91% of the conserved gene pairs that have been reported in the literature. When compared to existing software MUMmer [7, 16] and MaxMinCluster[12], our algorithm uncovers 15% and 7% more genes on average, respectively. The sensitivity of our algorithm is also slightly higher. The paper concludes with a remark on the computational hardness of the MUM Selection Problem.
Source Title: Proceedings - Fourth IEEE Symposium on Bioinformatics and Bioengineering, BIBE 2004
URI: http://scholarbank.nus.edu.sg/handle/10635/40035
ISBN: 0769521738
DOI: 10.1109/BIBE.2004.1317390
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

1
checked on Dec 6, 2017

Page view(s)

45
checked on Dec 10, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.