Results 21 to 30 of about 1,718 (234)
On the Complexity of Some Variations of Sorting by Transpositions [PDF]
Journal of Universal Computer Science, 2020 One of the main challenges in Computational Biology is to find the evolutionary distance between two organisms. In the field of comparative genomics, one way to estimate such distance is to find a minimum cost sequence of rearrangements (large scale ...
Alexsandro Alexandrino +3 more
doaj +3 more sources
The Shape of Fluvial Gravels: Insights from Fiji’s Sabeto River
Geosciences, 2021 This project aims to re-assess our understanding of the shape of fluvial bedload gravels by drawing together existing information on fluvial gravel shape.
S. J. Gale
doaj +1 more source
Incidencia de los estudios sobre reordenamiento genómico en la secuenciación del genoma humano
Revista Científica de FAREM-Estelí, 2023 En este artículo de revisión se muestran los principales aportes de la literatura científica relacionados con el problema SBPR (Sorting Permutations By Prefix Reversals, en español, Ordenamiento de permutaciones con reversión de prefijos) realizados en ...
Wilmer José Palacios López +1 more
doaj +1 more source
Approximation Algorithms for Sorting λ-Permutations by λ-Operations
Algorithms, 2021 Understanding how different two organisms are is one question addressed by the comparative genomics field. A well-accepted way to estimate the evolutionary distance between genomes of two organisms is finding the rearrangement distance, which is the ...
Guilherme Henrique Santos Miranda +3 more
doaj +1 more source
A Unidirectional Cell Switching Gate by Engineering Grating Length and Bending Angle. [PDF]
PLoS ONE, 2016 On a microgrooved substrate, cells migrate along the pattern, and at random positions, reverse their directions. Here, we demonstrate that these reversals can be controlled by introducing discontinuities to the pattern.
Shu Fan Zhou +5 more
doaj +1 more source
Perfect Sorting by Reversals Is Not Always Difficult [PDF]
IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2005 We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sorting signed permutations by reversals without breaking common intervals. We describe a combinatorial framework for this problem that allows us to characterize classes of signed ...
Paul, Christophe +3 more
openaire +4 more sources
The Solution Space of Sorting by Reversals [PDF]
, 2007 In comparative genomics, algorithms that sort permutations by reversals are often used to propose evolutionary scenarios of large scale genomic mutations between species. One of the main problems of such methods is that they give one solution while the number of optimal solutions is huge, with no criteria to discriminate among them. Bergeron et al. [4]
Braga, Marília +3 more
openaire +1 more source
Sampling solution traces for the problem of sorting permutations by signed reversals
Algorithms for Molecular Biology, 2012 Background Traditional algorithms to solve the problem of sorting by signed reversals output just one optimal solution while the space of all optimal solutions can be huge.
Baudet Christian +2 more
doaj +1 more source
Sorting signed circular permutations by super short operations
Algorithms for Molecular Biology, 2018 Background One way to estimate the evolutionary distance between two given genomes is to determine the minimum number of large-scale mutations, or genome rearrangements, that are necessary to transform one into the other.
Andre R. Oliveira +3 more
doaj +1 more source
Sorting Circular Permutations by Reversal [PDF]
, 2003 Unsigned circular permutations are used to represent tours in the traveling salesman problem as well as the arrangement of gene loci in circular chromosomes. The minimum number of segment reversals required to transform one circular permutation into another gives some measure of distance between them which is useful when studying the 2-opt local search
Andrew Solomon +2 more
openaire +1 more source