A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions
DOI10.1007/978-3-030-42266-0_2zbMATH Open1500.92057OpenAlexW3013236167MaRDI QIDQ5041121FDOQ5041121
Authors: Andre Oliveira, Géraldine Jean, Guillaume Fertin, Klairton Lima Brito, Ulisses Dias, Zanoni Dias 
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
Recommendations
- A \((1.408+\varepsilon )\)-approximation algorithm for sorting unsigned genomes by reciprocal translocations
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
- scientific article; zbMATH DE number 2073943
- A 2-approximation algorithm for genome rearrangements by reversals and transpositions
- An approximation algorithm for genome sorting by reversals to recover all adjacencies
- A faster algorithm for genomic sorting problem
- Working on the problem of sorting by transpositions on genome rearrangements
Genetics and epigenetics (92D10) Approximation algorithms (68W25) Computational methods for problems pertaining to biology (92-08)
Cites Work
Cited In (6)
- An improved quicksort algorithm based on tissue-like P systems with promoters
- Signed rearrangement distances considering repeated genes, intergenic regions, and indels
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
- A 2-approximation algorithm for genome rearrangements by reversals and transpositions
- Reversal distance on genomes with different gene content and intergenic regions information
- Reversals distance considering flexible intergenic regions sizes
This page was built for publication: A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041121)
