Optimal algorithms for uncovering synteny problem

DOI10.1007/S10878-006-9008-6MaRDI QIDQ2385477zbMATH OpenOpenAlexFDO

Authors Chen Ting, H. E. Yong

Publication date 12 October 2007

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-006-9008-6

zbMATH Keywords

Optimal algorithmSyntenic distanceUncovering synteny

Mathematics Subject Classification ID

Genetics and epigenetics (92D10) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Recommendations

• Further thoughts on the syntenic distance between genomes
• scientific article; zbMATH DE number 1615285
• Structural properties and tractability results for linear synteny
• scientific article; zbMATH DE number 2185631
• On the complexity and approximation of syntenic distance

Cites work

• scientific article; zbMATH DE number 1615285 (Why is no real title available?)
• scientific article; zbMATH DE number 2185631 (Why is no real title available?)
• scientific article; zbMATH DE number 1263193 (Why is no real title available?)
• A 2-approximation algorithm for genome rearrangements by reversals and transpositions
• Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
• Further thoughts on the syntenic distance between genomes
• Genome Rearrangements and Sorting by Reversals
• Gossip is synteny: Incomplete gossip and the syntenic distance between genomes
• On maximal instances for the original syntenic distance
• On the complexity and approximation of syntenic distance
• Signed genome rearrangement by reversals and transpositions: Models and approximations
• Sorting by Transpositions
• The syntenic diameter of the space of \(N\)-chromosome genomes

Cited in

(3)

• scientific article; zbMATH DE number 1615285 (Why is no real title available?)
• Structural properties and tractability results for linear synteny
• Gossip is synteny: Incomplete gossip and the syntenic distance between genomes

This page was built for publication: Optimal algorithms for uncovering synteny problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2385477)