On the complexity and approximation of syntenic distance
type: Item
instance of: scholarly article
title: On the complexity and approximation of syntenic distance
zbMATH Open document ID: 0928.68057
DOI: 10.1016/S0166-218X(98)00066-3
author: Tao Jiang
author: Sampath Kannan
author: Ming Li
author: Elizabeth Sweedyk
author: Bhaskar Dasgupta
published in: Discrete Applied Mathematics
publication date: 1999-06-20T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1268155
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
cites work: Genome Rearrangements and Sorting by Reversals
cites work: Q4886097
cites work: Q3619797
cites work: Q4198056
cites work: Q4234063
cites work: Q4886096
cites work: Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
cites work: Q4739657
description: scientific article; zbMATH DE number 1268155