Đang chuẩn bị nút TẢI XUỐNG, xin hãy chờ
Tải xuống
Tuyển tập các báo cáo nghiên cứu về sinh học được đăng trên tạp chí y học Molecular Biology cung cấp cho các bạn kiến thức về ngành sinh học đề tài: An asymmetric approach to preserve common intervals while sorting by reversals. | Algorithms for Molecular Biology BioMed Zentral Research Open Access An asymmetric approach to preserve common intervals while sorting by reversals Marília DV Braga 1 2 Christian Gautier1 and Marie-France Sagot1 Addresses 1Université de Lyon F-69000 Lyon Université Lyon 1 CNRS UMR5558 Inria Grenoble Rhône-Alpes France and 2Current address AG Genominformatik Technische Fakultăt Universităt Bielefeld Germany E-mail Marília DV Braga - mdvbraga@gmail.com Christian Gautier - cgautier@biomserv.univ-lyon1.fr Marie-France Sagot - Marie-France.Sagot@inria.fr Corresponding author Published 30 December 2009 Received 6 March 2009 Algorithms for Molecular Biology 2009 4 16 doi 10.1186 1748-7188-4-16 Accepted 30 December 2009 This article is available from http www.almob.Org content 4 1 16 2009 Braga et al licensee BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License http creativecommons.org licenses by 2.0 which permits unrestricted use distribution and reproduction in any medium provided the original work is properly cited. Abstract Background The reversal distance and optimal sequences of reversals to transform a genome into another are useful tools to analyse evolutionary scenarios. However the number of sequences is huge and some additional criteria should be used to obtain a more accurate analysis. One strategy is searching for sequences that respect constraints such as the common intervals clusters of colocalised genes . Another approach is to explore the whole space of sorting sequences eventually grouping them into classes of equivalence. Recently both strategies started to be put together to restrain the space to the sequences that respect constraints. In particular an algorithm has been proposed to list classes whose sorting sequences do not break the common intervals detected between the two inital genomes A and B. This approach may reduce the space of sequences and is symmetric the result of the .
