.png){kind=icon}
.png){kind=icon}
Return
A (1.5+ε)-approximation algorithm for unsigned translocation distance
.png){kind=icon}
PRE
AI
DOI：10.1109/TCBB.2007.70216.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Genome rearrangement is an important area in computational biology and bioinformatics. The translocation operation is one of the popular operations for genome rearrangement. It was proved that computing the unsigned translocation distance is NP-hard. In this paper, we present a (1.5 + E)-approximation algorithm for computing the unsigned translocation distance that 4), improves upon the best known 1.75-ratio. The runtime of our algorithm is O(n(2) + (4/epsilon)(1.5) root log(4/epsilon)2(4/epsilon)), where n is the total number of genes in the genome.
Keywords:
genome rearrangement
unsigned translocation
approximation algorithms
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
3.4
Papers:
3.3K
Citations:
6.4K