Sorting Signed Permutations by Reversal (Reversal Sequence)
Publisher
Springer New York
Reference19 articles.
1. Ajana Y, Lefebvre J-F, Tillier E, El-Mabrouk N (2002) Exploring the set of all minimal sequences of reversals – an application to test the replication-directed reversal hypothesis. In: Proceedings of the second workshop on algorithms in bioinformatics. Lecture notes in computer science, vol 2452. Springer, Berlin, pp 300–315
2. Attie O, Darling A, Yancopoulos Y (2011) The rise and fall of breakpoint reuse depending on genome resolution. BMC Bioinform 12(supp 9):S1
3. Bader DA, Moret BME, Yan M (2001) A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. J Comput Biol 8(5):483–491
4. Badr G, Swenson KM, Sankoff D (2011) Listing all parsimonious reversal sequences: new algorithms and perspectives. J Comput Biol 18:1201–1210
5. Braga MDV, Sagot MF, Scornavacca C, Tannier E (2008) Exploring the solution space of sorting by reversals with experiments and an application to evolution. IEEE-ACM Trans Comput Biol Bioinform 5:348–356