Cargando…
Sorting signed permutations by short operations
BACKGROUND: During evolution, global mutations may alter the order and the orientation of the genes in a genome. Such mutations are referred to as rearrangement events, or simply operations. In unichromosomal genomes, the most common operations are reversals, which are responsible for reversing the...
Autores principales: | Galvão, Gustavo Rodrigues, Lee, Orlando, Dias, Zanoni |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2015
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4383228/ https://www.ncbi.nlm.nih.gov/pubmed/25838839 http://dx.doi.org/10.1186/s13015-015-0040-x |
Ejemplares similares
-
Sorting signed circular permutations by super short operations
por: Oliveira, Andre R., et al.
Publicado: (2018) -
Sampling solution traces for the problem of sorting permutations by signed reversals
por: Baudet, Christian, et al.
Publicado: (2012) -
Sorting permutations by cut-circularize-linearize-and-paste operations
por: Huang, Keng-Hsuan, et al.
Publicado: (2011) -
Operations on Permutation Automata
por: Hospodár, Michal, et al.
Publicado: (2020) -
Sorting by weighted inversions considering length and symmetry
por: Baudet, Christian, et al.
Publicado: (2015)