Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
SIAM Journal on Discrete Mathematics
Of mice and men: algorithms for evolutionary distances between genomes with translocation
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Fast practical solution of sorting by reversals
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Discrete Mathematics
Transforming men into mice (polynomial algorithm for genomic distance problem)
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
A New Approach for Approximating the Transposition Distance
SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
New Bounds and Tractable Instances for the Transposition Distance
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A 1.375-Approximation Algorithm for Sorting by Transpositions
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Constraint Logic Programming using Eclipse
Constraint Logic Programming using Eclipse
On the Toric Graph as a Tool to Handle the Problem of Sorting by Transpositions
BSB '08 Proceedings of the 3rd Brazilian symposium on Bioinformatics: Advances in Bioinformatics and Computational Biology
Transposition Distance Based on the Algebraic Formalism
BSB '08 Proceedings of the 3rd Brazilian symposium on Bioinformatics: Advances in Bioinformatics and Computational Biology
A new and faster method of sorting by transpositions
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Hi-index | 0.00 |
Genome Rearrangements addresses the problem of finding the minimum number of global operations, such as transpositions, reversals, fusions and fissions that transform a given genome into another. In this paper we deal with transposition events, which are events that change the position of two contiguous block of genes in the same chromosome. The transposition event generates the transposition distance problem, that is to find the minimum number of transposition that transform one genome (or chromosome) into another. Although some tractables instances were found [20,14], it is not known if an exact polynomial time algorithm exists. Recently, Dias and Souza [9] proposed polynomial-sized Integer Linear Programming (ILP) models for rearrangement distance problems where events are restricted to reversals, transpositions or a combination of both. In this work we devise a slight different approach. We present some Constraint Logic Programming (CLP) models for transposition distance based on known bounds to the problem.