A 1.75-approximation algorithm for unsigned translocation distance

DOI10.1016/J.JCSS.2007.03.009MaRDI QIDQ2643729zbMATH OpenOpenAlexFDO

Authors Yun Cui, Lusheng Wang, Daming Zhu

Publication date 27 August 2007

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcss.2007.03.009

zbMATH Keywords

approximation algorithmunsigned translocation distance

Mathematics Subject Classification ID

Genetics and epigenetics (92D10) Protein sequences, DNA sequences (92D20) Approximation algorithms (68W25)

Recommendations

• Algorithms and Computation
• A 1.375-approximation algorithm for unsigned translocation sorting
• A new approximation algorithm for unsigned translocation sorting
• On the complexity of unsigned translocation distance
• A \((1.408+\varepsilon )\)-approximation algorithm for sorting unsigned genomes by reciprocal translocations

Cites work

• scientific article; zbMATH DE number 1263193 (Why is no real title available?)
• scientific article; zbMATH DE number 910919 (Why is no real title available?)
• A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
• Comparative genomics. Empirical and analytical approaches to gene order dynamics, map alignment and the evolution of gene families. Papers at the DCAF workshop, Québec, Canada, September 22--25, 2000
• Genome Rearrangements and Sorting by Reversals
• Matching theory
• On the complexity of unsigned translocation distance
• Polynomial-time algorithm for computing translocation distance between genomes
• Research in Computational Molecular Biology

Cited in

(9)

• On the complexity of unsigned translocation distance
• Algorithms and Computation
• A \((1.408+\varepsilon )\)-approximation algorithm for sorting unsigned genomes by reciprocal translocations
• A factor-\((1.408+\varepsilon)\) approximation for sorting unsigned genomes by reciprocal translocations
• A new approximation algorithm for unsigned translocation sorting
• Structural, Syntactic, and Statistical Pattern Recognition
• A 1.375-approximation algorithm for unsigned translocation sorting
• Exact and approximation algorithms for the contiguous translocation distance problem
• Can a breakpoint graph be decomposed into none other than 2-cycles?

This page was built for publication: A 1.75-approximation algorithm for unsigned translocation distance

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