Please use this identifier to cite or link to this item:
|Title:||Divide-and-conquer approach for the exemplar breakpoint distance||Authors:||Nguyen, C.T.
|Issue Date:||15-May-2005||Citation:||Nguyen, C.T., Tay, Y.C., Zhang, L. (2005-05-15). Divide-and-conquer approach for the exemplar breakpoint distance. Bioinformatics 21 (10) : 2171-2176. ScholarBank@NUS Repository. https://doi.org/10.1093/bioinformatics/bti327||Abstract:||Motivation: A one-to-one correspondence between the sets of genes in the two genomes being compared is necessary for the notions of breakpoint and reversal distances. To compare genomes where there are paralogous genes, Sankoff formulated the exemplar distance problem as a general version of the genome rearrangement problem. Unfortunately, the problem is NP-hard even for the breakpoint distance. Results: This paper proposes a divide-and-conquer approach for calculating the exemplar breakpoint distance between two genomes with multiple gene families. The combination of our approach and Sankoff's branch-and-bound technique leads to a practical program to answer this question. Tests with both simulated and real datasets show that our program is much more efficient than the existing program that is based only on the branch-and-bound technique. © The Author 2005. Published by Oxford University Press. All rights reserved.||Source Title:||Bioinformatics||URI:||http://scholarbank.nus.edu.sg/handle/10635/103155||ISSN:||13674803||DOI:||10.1093/bioinformatics/bti327|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 7, 2020
WEB OF SCIENCETM
checked on Jun 22, 2020
checked on Jun 27, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.