Results 91 to 100 of about 1,350 (116)

Listing Sorting Sequences of Reversals and Translocations

Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics, 2013
Algorithms for sorting by reversals and translocations (SBRT) are often used to propose evolutionary scenarios of multichromosomal genomes. The existing algorithms for the SBRT problem provide a single sorting sequence of reversals and translocations.
Amritanjali, Gadadhar Sahoo
openaire   +1 more source

Experimental and Statistical Analysis of Sorting by Reversals

2000
Sorting by reversals is one of the most widely studied models of genome rearrangements in molecular biology. In this paper, we first briefly review the state-of-the-art methods to solve the problem. Then, we start to investigate the relevance of the reversal distance when used to draw conclusions that are biologically meaningful.
CAPRARA A., LANCIA, Giuseppe
openaire   +2 more sources

Programming Techniques for Reversible Comparison Sorts

2015
A common approach to reversible programming is to reversibly simulate an irreversible program with the desired functionality, which in general puts additional pressure on the computational resources (time, space.) If the same running time is required, ensuring a minimal space overhead is a significant programming challenge.
Holger Bock Axelsen, Tetsuo Yokoyama
openaire   +2 more sources

1.375-Approximation Algorithm for Sorting by Reversals

2002
Analysis of genomes evolving by inversions leads to a general combinatorial problem of Sorting by Reversals, MIN-SBR, the problem of sorting a permutation by a minimum number of reversals. Following a series of preliminary results, Hannenhalli and Pevzner developed the first exact polynomial time algorithm for the problem of sorting signed permutations
Piotr Berman, Sridhar Hannenhalli, Marek Karpinski   +2 more
openaire   +2 more sources

An algorithm to enumerate all sorting reversals

Proceedings of the sixth annual international conference on Computational biology, 2002
The problem of estimating evolutionary distance from differences in gene order has been distilled to the problem of finding the reversal distance between two signed permutations. During the last decade, much progress was made both in computing reversal distance and in finding a minimum sequence of sorting reversals. For most problem instances, however,
openaire   +1 more source

Sorting by Translocations Via Reversals Theory

2006
The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of genome rearrangements that “sorts” one genome into another. In this paper we focus on sorting a multi-chromosomal genome by translocations.
Michal Ozery-Flato, Ron Shamir
openaire   +1 more source

SORTING SIGNED PERMUTATIONS BY FIXED-LENGTH REVERSALS

International Journal of Foundations of Computer Science, 2006
A signed n-permutation is a permutation on {1,2,…,n} in which each element is labelled by a positive or negative sign. Here we consider the problem of sorting signed permutations by fixed-length reversals. Indeed, limiting the transformations to reversals of length exactly k can be very restrictive, for example, (+1,+3,+2,+4,…,+n) can never be sorted ...
Xingqin Qi, Guojun Li, Jichang Wu, Bingqiang Liu   +3 more
openaire   +1 more source

Sorting Permutations by Reversals Through Branch-and-Price

INFORMS Journal on Computing, 2001
We describe an exact algorithm for the problem of sorting a permutation by the minimum number of reversals, originating from evolutionary studies in molecular biology. Our approach is based on an integer linear programming formulation of a graph-theoretic relaxation of the problem, calling for a decomposition of the edge set of a bicolored graph into ...
CAPRARA A., LANCIA, Giuseppe, NG S. K.
openaire   +2 more sources

Sorting by reversals is difficult

Proceedings of the first annual international conference on Computational molecular biology - RECOMB '97, 1997
openaire   +1 more source

An (18/11)n upper bound for sorting by prefix reversals

Theoretical Computer Science, 2009
I H Sudborough
exaly