The solution space of sorting by reversals

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4463 LNBI, Issue , 2007, Pages 293-304

  Braga, Marília D V ^a   Sagot, Marie France ^a   Scornavacca, Celine ^b   Tannier, Eric ^a  

^a UNIVERSITÉ LYON 1   (France)

^b LIRMM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EQUIVALENCE CLASSES; EVOLUTIONARY ALGORITHMS; GENETIC ENGINEERING; PROBLEM SOLVING; SET THEORY;

ENUMERATION METHOD; GENOMICS; OPTIMAL SOLUTIONS; PERMUTATIONS;

BIOINFORMATICS;

EID: 34547488922     PISSN: 03029743     EISSN: 16113349     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-72031-7_27     Document Type: Conference Paper

References (17)

1. Ajana Y., Lefebvre J.F., Tillier E., El-Mabrouk N., "Exploring the set of all minimal sequences of reversals - An application to test the replication-directed reversal hypothesis". Second International Workshop, Algorithms in Bioinformatics (WABI'02), LNCS 2452, R. Guigo and D. Gusfield eds., pp. 300-315, September 2002.
2. Bader, D.A., Moret, B.M.E., and Yan, M., "A linear-time algorithm for computing inversion distances between signed permutations with an experimental study", J. Comput. Biol. 8, 5 (2001), 483-491.
3. Berard S., Bergeron A., Chauve C. and Paul C. "Perfect sorting by reversals is not always difficult", to appear in IEEE transactions on cioinformatics and computational biology, 2006.
4. Bergeron A., Chauve C., Hartmann T., St-Onge K., "On the properties of sequences of reversals that sort a signed permutation". JOBIM 2002, 99-108.
5. Bergeron A., Mixtacki J. and Stoye J., "The inversion distance problem", in Mathematics of evolution and phylogeny (O. Gascuel Ed.) Oxford University Press, 2005.
6. Brightwell G. and Winkler P., "Counting linear extensions is #P-complete", STOC '91: Proceedings of the twenty-third annual ACM symposium on Theory of computing, 1991, ACM Press.
7. Diekert V. Rozenberg G. (eds) The book of traces, World Scientific, 1995.
8. Diekmann Y., Sagot M.F. and Tannier E., "Evolution under reversals: parsimony and preservation of common intervals", to appear in IEEE/A CM transactions in computational biology and bioinformatics, 2006 (A preliminary version appeared in COCOON 2005, Lecture Notes in Computer Science 3595, 42-51, 2005).
9. Dilworth R.P., "A Decomposition Theorem for Partially Ordered Sets", Annuals of Mathematics 51 (1950) pp. 161-166.
10. Fulkerson D.R., "Note on Dilworth's decomposition theorem for partially ordered sets", Proc. Amer. Math. Soc. 7 (1956), 701-702
11. Han Y, "Improving the Efficiency of Sorting by Reversals", Proceedings of The 2006 International Conference on Bioinformatics and Computational Biology, CSREA Press, Las Vegas, Nevada, USA, 2006.
12. Hannenhalli S. and Pevzner P., "Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals)", Journal of the ACM, 46:1-27, 1999.
13. Li Z., Wang L. and Zhang K., "Algorithmic approaches for genome rearrangement: a review", IEEE transactions on systems, man and cybernetics, 36:636-648, 2006.
14. Siepel A. "An algorithm to enumerate sorting reversals for signed permutations". J Comput Biol 10:575-597, 2003.
15. Steiner G., "An algorithm to generate the ideals of a partial order" Operations Research Letters, 5(6):317 - 320, 1986.
16. Steiner G., "Polynomial algorithms to count linear extensions in certain posets". Congressus Numerantium, 75, 71-90, 1990
17. Tannier E., Bergeron A. and Sagot M.-F., "Advances on Sorting by Reversals", to appear in Discrete Applied Mathematics, 2006 (A preliminary version appeared in CPM 2004, Lecture Notes in Computer Science 3595, 42-51).