Exact and approximation algorithms for the contiguous translocation distance problem

DOI10.1016/J.TCS.2024.115003MaRDI QIDQ6658300

Maria Constantin, Alexandru N. Popa

Publication date: 8 January 2025

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

zbMATH Keywords

approximation algorithmDNA computingNP-hard problemtranslocation distancegenome distances

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the complexity of unsigned translocation distance
• Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
• A 1.375-approximation algorithm for unsigned translocation sorting
• A 1.75-approximation algorithm for unsigned translocation distance
• A (1.408+ε)-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations
• Compression of individual sequences via variable-rate coding
• Combinatorial Pattern Matching
• Structural, Syntactic, and Statistical Pattern Recognition
• On the Cost of Interchange Rearrangement in Strings
• Polynomial-time algorithm for computing translocation distance between genomes

This page was built for publication: Exact and approximation algorithms for the contiguous translocation distance problem

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