`application/pdf`

.

##
###
On the complexity and approximation of syntenic distance

1997
*
Proceedings of the first annual international conference on Computational molecular biology - RECOMB '97
*

The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by F erretti, Nadeau and Sanko . Here, a chromosome is represented as a set of genes and a genome is a collections of chromosomes. The syntenic distance between two genomes is de ned as the minimum number of translocations, fusions and ssions required to transform one genome into the other. We prove that computing the syntenic distance

doi:10.1145/267521.267536
dblp:conf/recomb/DasGuptaJKLS97
fatcat:66edrttemnbwthk6v7xbqzgzc4