On maximal instances for the original syntenic distance

DOI10.1016/j.tcs.2004.05.006zbMath1071.92502OpenAlexW2032125335MaRDI QIDQ703532

Cedric Chauve, Guillaume Fertin

Publication date: 11 January 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.05.006

zbMATH Keywords

Computational biologyGossipingSyntenic distance

Mathematics Subject Classification ID

Problems related to evolution (92D15) Genetics and epigenetics (92D10)

Related Items (3)

Optimal algorithms for uncovering synteny problem ⋮ Odd gossiping ⋮ On maximal instances for the original syntenic distance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Further thoughts on the syntenic distance between genomes
• On maximal instances for the original syntenic distance
• On the complexity and approximation of syntenic distance
• Combinatorial pattern matching. 7th annual symposium, CPM '96, Laguna Beach, CA, USA, June 10--12, 1996. Proceedings
• Gossip is synteny: Incomplete gossip and the syntenic distance between genomes
• Transforming cabbage into turnip
• A survey of gossiping and broadcasting in communication networks
• Sorting by Transpositions
• Genome Rearrangements and Sorting by Reversals

This page was built for publication: On maximal instances for the original syntenic distance