Gossip is synteny: Incomplete gossip and the syntenic distance between genomes
From MaRDI portal
Publication:3150285
DOI10.1016/S0196-6774(02)00006-8zbMath1005.68050MaRDI QIDQ3150285
Publication date: 30 September 2002
Published in: Journal of Algorithms (Search for Journal in Brave)
Related Items (5)
Optimal algorithms for uncovering synteny problem ⋮ The epistemic gossip problem ⋮ A lightweight epistemic logic and its application to planning ⋮ Odd gossiping ⋮ On maximal instances for the original syntenic distance
This page was built for publication: Gossip is synteny: Incomplete gossip and the syntenic distance between genomes