Estimating Genome Reversal Distance by Genetic Algorithm

Simple item page
dc.creatorAuYeung, Andy
dc.creatorAbraham, Ajith
dc.date2004-05-05
dc.date.accessioned2026-07-07T03:21:11Z
dc.date.available2026-07-07T03:21:11Z
dc.descriptionSorting by reversals is an important problem in inferring the evolutionary relationship between two genomes. The problem of sorting unsigned permutation has been proven to be NP-hard. The best guaranteed error bounded is the 3/2- approximation algorithm. However, the problem of sorting signed permutation can be solved easily. Fast algorithms have been developed both for finding the sorting sequence and finding the reversal distance of signed permutation. In this paper, we present a way to view the problem of sorting unsigned permutation as signed permutation. And the problem can then be seen as searching an optimal signed permutation in all n2 corresponding signed permutations. We use genetic algorithm to conduct the search. Our experimental result shows that the proposed method outperform the 3/2-approximation algorithm.
dc.identifierhttps://arxiv.org/abs/cs/0405014
dc.identifierhttp://arxiv.org/abs/cs/0405014
dc.identifier2003 IEEE Congress on Evolutionary Computation (CEC2003), Australia, IEEE Press, ISBN 0780378040, pp. 1157-1161, 2003
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32103
dc.subjectArtificial Intelligence
dc.subjectI.2.0
dc.titleEstimating Genome Reversal Distance by Genetic Algorithm
dc.typetext

Files

Collections

arXiv