A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions

DOI10.1007/978-3-030-42266-0_2zbMath1500.92057OpenAlexW3013236167MaRDI QIDQ5041121

Ulisses Dias, Zanoni Dias, Andre Rodrigues Oliveira, Guillaume Fertin, Klairton Lima Brito, Géraldine Jean

Publication date: 13 October 2022

Published in: Algorithms for Computational Biology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-42266-0_2

zbMATH Keywords

approximation algorithmtranspositionsgenome rearrangementsintergenic regions

Mathematics Subject Classification ID

Genetics and epigenetics (92D10) Approximation algorithms (68W25) Computational methods for problems pertaining to biology (92-08)

Related Items (1)

Reversals distance considering flexible intergenic regions sizes

Cites Work

• Unnamed Item
• Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
• Sorting by Transpositions Is Difficult
• Comparative Genomics on Artificial Life
• Sorting by Transpositions

This page was built for publication: A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions