A new 1.375-approximation algorithm for sorting by transpositions

BACKGROUND: sorting by transpositions (SBT) is a classical problem in genome rearrangements. In 2012, SBT was proven to be [Formula: see text] -hard and the best approximation algorithm with a 1.375 ratio was proposed in 2006 by Elias and Hartman (EH algorithm). Their algorithm employs simplificatio...

Descripción completa

Detalles Bibliográficos
Autores principales: Silva, Luiz Augusto G., Kowada, Luis Antonio B., Rocco, Noraí Romeu, Walter, Maria Emília M. T.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2022
Materias:
Research
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8760837/
https://www.ncbi.nlm.nih.gov/pubmed/35033127
http://dx.doi.org/10.1186/s13015-022-00205-z

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8760837/
https://www.ncbi.nlm.nih.gov/pubmed/35033127
http://dx.doi.org/10.1186/s13015-022-00205-z

Ejemplares similares