Gossip is synteny: incomplete gossip and an exact algorithm for syntenic distance
SODA(2001)
摘要
The syntenic distance between two genomes is given by the minimum number of fusions, fissions, and translocations required to transform one into the other, ignoring the order of genes within chromosomes. The problem of computing this distance is NP-complete. In this paper, we give an &Ogr;(2&Ogr;(n log n)) algorithm to exactly compute the syntenic distance between two genomes that contain at most n chromosomes. Our algorithm requires &Ogr;(2&Ogr;(d log d)) time when this distance is d, improving the &Ogr;(2&Ogr;(d2)) running time of the beat previous exact algorithm. Our result is based upon a tight connection between syntenic distance and a novel generalization of the classical gossip problem. We define the incomplete gossip problem, in which there are n gossipers who each have a unique piece of initial information. They communicate by phone calls in which the participants exchange all their information, and the goal is to minimize the total number of phone calls necessary to inform each gossiper of his set of relevant gossip which he desires to learn.
更多查看译文
关键词
n chromosome,syntenic distance,n gossiper,initial information,n log n,minimum number,incomplete gossip problem,classical gossip problem,beat previous exact algorithm,relevant gossip,np completeness,approximation algorithms,manufacturing,covering
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络