Abstract
In computational biology, gene order data is often modelled as signed permutations. A classical problem in genome comparison is to detect conserved segments in a permutation, that is, genes that are co-localised in several species, indicating that they remained grouped during evolution. A second largely studied problem related to gene order data is to compute a minimum scenario of reversals that transforms a signed permutation into another. Several studies began to mix the two problems, and it was observed that their results are not always compatible: often parsimonious scenarios of reversals break conserved segments. In a recent study, Bérard, Bergeron and Chauve stated as an open question whether it was possible to design a polynomial time algorithm to decide if there exists a minimum scenario of reversals that transforms a genome into another while keeping the clusters of co-localised genes together. In this paper, we give this polynomial algorithm, and thus generalise the theoretical result of the aforementioned paper.
This work is funded by the French program ACI “New interfaces of Mathematics: Mathematical and algorithmical aspects of biochemical and evolutionary networks”, and by the INRIA coordinated action ARC “Integrated Biological Networks”.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beal, M.-P., Bergeron, A., Corteel, S., Raffinot, M.: An Algorithmic View of Gene Teams. Theor. Comput. Sci. 320(2-3), 395–418 (2004)
Bérard, S., Bergeron, A., Chauve, C.: Conserved structures in evolution scenarios. In: 2nd RECOMB Comparative Genomics Satellite Workshop. Lecture Notes in BioInfomatics (2004) (to appear)
Bergeron, A., Heber, S., Stoye, J.: Common Intervals and Sorting by Reversals: A Marriage of Necessity. Bioinformatics 1, 1–10 (2002)
Bergeron, A., Mixtacki, J., Stoye, J.: The inversion distance problem. In: Gascuel, O. (ed.) Mathematics of evolution and phylogeny, Oxford University Press, Oxford (2005)
Bui Xuan, B.M., Habib, M., Paul, C.: From permutations to Graph Algorithms, Research Report LIRMM RR-05021 (2005)
Figeac, M., Varré, J.-S.: Sorting by reversals with common intervals. In: Jonassen, I., Kim, J. (eds.) WABI 2004. LNCS (LNBI), vol. 3240, pp. 26–37. Springer, Heidelberg (2004)
Hannenhalli, S., Pevzner, P.: Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals. In: Proceedings of the 27th ACM Symposium on Theory of Computing, pp. 178–189 (1995)
Heber, S., Stoye, J.: Finding all Common Intervals of k Permutations. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol. 2089, pp. 207–218. Springer, Heidelberg (2001)
Tannier, E., Bergeron, A., Sagot, M.-F.: Advances on Sorting by Reversals, to appear in Discrete Applied Mathematics (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sagot, MF., Tannier, E. (2005). Perfect Sorting by Reversals. In: Wang, L. (eds) Computing and Combinatorics. COCOON 2005. Lecture Notes in Computer Science, vol 3595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11533719_7
Download citation
DOI: https://doi.org/10.1007/11533719_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28061-3
Online ISBN: 978-3-540-31806-4
eBook Packages: Computer ScienceComputer Science (R0)