Cargando…
Super short operations on both gene order and intergenic sizes
BACKGROUND: The evolutionary distance between two genomes can be estimated by computing a minimum length sequence of operations, called genome rearrangements, that transform one genome into another. Usually, a genome is modeled as an ordered sequence of genes, and most of the studies in the genome r...
Autores principales: | Oliveira, Andre R., Jean, Géraldine, Fertin, Guillaume, Dias, Ulisses, Dias, Zanoni |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6833170/ https://www.ncbi.nlm.nih.gov/pubmed/31709002 http://dx.doi.org/10.1186/s13015-019-0156-5 |
Ejemplares similares
-
Sorting signed circular permutations by super short operations
por: Oliveira, Andre R., et al.
Publicado: (2018) -
A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions
por: Oliveira, Andre Rodrigues, et al.
Publicado: (2020) -
Algorithms for computing the double cut and join distance on both gene order and intergenic sizes
por: Fertin, Guillaume, et al.
Publicado: (2017) -
An improved approximation algorithm for the reversal and transposition distance considering gene order and intergenic sizes
por: Brito, Klairton L., et al.
Publicado: (2021) -
Approximation algorithm for rearrangement distances considering repeated genes and intergenic regions
por: Siqueira, Gabriel, et al.
Publicado: (2021)