Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/92560
Type: Artigo de evento
Title: Constraint Programming Models For Transposition Distance Problem
Author: Dias U.
Dias Z.
Abstract: 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. © 2009 Springer Berlin Heidelberg.
Editor: 
Rights: fechado
Identifier DOI: 10.1007/978-3-642-03223-3_2
Address: http://www.scopus.com/inward/record.url?eid=2-s2.0-69949185523&partnerID=40&md5=d6db618502ee8c61620fcc6af4764b09
Date Issue: 2009
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.