Cargando…
A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions
Genome Rearrangements affect large stretches of genomes during evolution. One of the most studied genome rearrangement is the transposition, which occurs when a sequence of genes is moved to another position inside the genome. Mathematical models have been used to estimate the evolutionary distance...
Autores principales: | Oliveira, Andre Rodrigues, Jean, Géraldine, Fertin, Guillaume, Brito, Klairton Lima, Dias, Ulisses, Dias, Zanoni |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7197096/ http://dx.doi.org/10.1007/978-3-030-42266-0_2 |
Ejemplares similares
-
An improved approximation algorithm for the reversal and transposition distance considering gene order and intergenic sizes
por: Brito, Klairton L., et al.
Publicado: (2021) -
Super short operations on both gene order and intergenic sizes
por: Oliveira, Andre R., et al.
Publicado: (2019) -
Sorting signed circular permutations by super short operations
por: Oliveira, Andre R., et al.
Publicado: (2018) -
Approximation algorithm for rearrangement distances considering repeated genes and intergenic regions
por: Siqueira, Gabriel, et al.
Publicado: (2021) -
Heuristics for Reversal Distance Between Genomes with Duplicated Genes
por: Siqueira, Gabriel, et al.
Publicado: (2020)