[1] Harry Dweighter. Problem E2569. American Mathematical Monthly, 82:1010, 1975. [ bib ]
[2] William H. Gates and Christos H. Papadimitriou. Bounds for Sorting by Prefix Reversal. Discrete Mathematics, 27(1):47--57, 1979. [ bib ]
[3] Mark R. Jerrum. The Complexity of Finding Minimum-length Generator Sequences. Theoretical Computer Science, 36(2-3):265--289, 1985. [ bib ]
[4] Martin Aigner and Douglas B. West. Sorting by Insertion of Leading Elements. Journal of Combinatorial Theory Series A, 45(2):306--309, 1987. [ bib ]
[5] Naruya Saitou and Masatoshi Nei. The Neighbor-joining Method: A New Method for Reconstructing Phylogenetic Trees. Molecular Biology and Evolution, 4(4):406--425, 1987. [ bib ]
[6] Mohammad H. Heydari and Ivan H. Sudborough. On Sorting by Prefix Reversals and the Diameter of Pancake Networks. In F. Meyer, B. Monien, and A. Rosenberg, editors, Proceedings of the 1st Heinz Nixdorf Symposium on Parallel Architectures and Their Efficient Use, volume 678 of Lecture Notes in Computer Science, pages 218--227. Springer-Verlag Berlin Heidelberg, Heidelberg/Berlin, Germany, 1993. [ bib ]
[7] S. Lakshmivarahan, Jung-Sing Jwo, and Sudarshan Dhall. Symmetry in Interconnection Networks Based on Cayley Graphs of Permutation Groups: a Survey. Parallel Computing, 19(4):361--407, 1993. [ bib ]
[8] John D. Kececioglu and David Sankoff. Efficient Bounds for Oriented Chromosome Inversion Distance. In M. Crochemore and D. Gusfield, editors, Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching (CPM'1994), volume 807 of Lecture Notes in Computer Science, pages 307--325. Springer-Verlag Berlin Heidelberg, Heidelberg/Berlin, Germany, 1994. [ bib ]
[9] Sridhar Hannenhalli and Pavel A. Pevzner. Transforming Men into Mice (Polynomial Algorithm for Genomic Distance Problem). In Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS'1995), pages 581--592, Washington, DC, USA, 1995. IEEE Computer Society Press. [ bib ]
[10] Sridhar Hannenhalli, Colombe Chappey, Eugene V. Koonin, and Pavel A. Pevzner. Genome Sequence Comparison and Scenarios for Gene Rearrangements: a Test Case. Genomics, 30:299--311, 1995. [ bib ]
[11] Pavel A. Pevzner and Michael S. Waterman. Open Combinatorial Problems in Computational Molecular Biology. In Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'1995), pages 158--173, Washington, DC, USA, 1995. IEEE Computer Society. [ bib ]
[12] John D. Kececioglu and David Sankoff. Exact and Approximation Algorithms for Sorting by Reversals, with Application to Genome Rearrangement. Algorithmica, 13:180--210, 1995. [ bib ]
[13] John D. Kececioglu and R. Ravi. Of Mice and Men: Algorithms for Evolutionary Distances Between Genomes with Translocation. In K. Clarkson, editor, Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'1995), pages 604--613, Philadelphia, PA, USA, 1995. Society for Industrial and Applied Mathematics. [ bib ]
[14] David S. Cohen and Manuel Blum. On the Problem of Sorting Burnt Pancakes. Discrete Applied Mathematics, 61(2):105--120, 1995. [ bib ]
[15] Vineet Bafna and Pavel A. Pevzner. Sorting by Reversals: Genome Rearrangements in Plant Organelles and Evolutionary History of X Chromosome. Molecular Biology and Evolution, 12(2):239--246, 1995. [ bib ]
[16] Sridhar Hannenhalli. Polynomial-time Algorithm for Computing Translocation Distance between Genomes. In Z. Galil and E. Ukkonen, editors, Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching (CPM'1995), volume 937 of Lecture Notes in Computer Science, pages 162--176, Heidelberg/Berlin, Germany, 1995. Springer Berlin Heidelberg. [ bib ]
[17] Vineet Bafna and Pavel A. Pevzner. Genome Rearrangements and Sorting by Reversals. SIAM Journal on Computing, 25(2):272--289, 1996. [ bib ]
[18] Ting Chen and Steven S. Skiena. Sorting with Fixed-Length Reversals. Discrete Applied Mathematics, 71(1-3):269--295, 1996. [ bib ]
[19] David A. Christie. Sorting Permutations by Block-Interchanges. Information Processing Letters, 60(4):165--169, 1996. [ bib ]
[20] Mathieu Blanchette, Takashi Kunisawa, and David Sankoff. Parametric Genome Rearrangement. Gene, 172(1):GC11--GC17, 1996. [ bib ]
[21] Sridhar Hannenhalli and Pavel Pevzner. To Cut ... or Not to Cut (Applications of Comparative Physical Maps in Molecular Evolution). In E. Tardos, editor, Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'1996), pages 304--313, Philadelphia, PA, USA, 1996. Society for Industrial and Applied Mathematics. [ bib ]
[22] João Meidanis, Maria E. M. T. Walter, and Zanoni Dias. Distância de Reversão de Cromossomos Circulares. In Proceedings of the 24th Seminário Integrado de Software e Hardware (SEMISH'1997), pages 119--131, 1997. In Portuguese. [ bib ]
[23] João Meidanis, Maria E. M. T. Walter, and Zanoni Dias. Transposition Distance Between a Permutation and its Reverse. In R. Baeza-Yates, editor, Proceedings of the 4th South American Workshop on String Processing (WSP'1997), pages 70--79, Ontario, Canada, 1997. Carleton University Press. [ bib ]
[24] Mohammad H. Heydari and Ivan H. Sudborough. On the Diameter of the Pancake Network. Journal of Algorithms, 25(1):67--94, 1997. [ bib ]
[25] Scott A. Guyer, Lenwood S. Heath, and John P. Vergara. Subsequence and Run Heuristics for Sorting by Transpositions. Technical Report TR-97-20, Virginia Polytechnic Institute & State University, Blacksburg, VA, USA, 1997. [ bib ]
[26] Stephen F. Altschul, Thomas L. Madden, Alejandro A. Schaffer, Jinghui Zhang, Zheng Zhang, Webb Miller, and David J. Lipman. Gapped BLAST and PSI-BLAST: a new Generation of Protein Database Search Programs. Nucleic Acids Research, 25:3389--3402, 1997. [ bib ]
[27] David A. Christie. A 3/2-Approximation Algorithm for Sorting by Reversals. In H. Karloff, editor, Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'1998), pages 244--252, Philadelphia, PA, USA, 1998. Society for Industrial and Applied Mathematics. [ bib ]
[28] David A. Christie. Genome Rearrangement Problems. PhD thesis, Department of Computing Science, University of Glasgow, 1998. [ bib ]
[29] Vineet Bafna and Pavel A. Pevzner. Sorting by Transpositions. SIAM Journal on Discrete Mathematics, 11(2):224--240, 1998. [ bib ]
[30] Maria E. M. T. Walter, Zanoni Dias, and João Meidanis. Reversal and Transposition Distance of Linear Chromosomes. In Proceedings of the 5th International Symposium on String Processing and Information Retrieval (SPIRE'1998), pages 96--102, Los Alamitos, CA, USA, 1998. IEEE Computer Society. [ bib ]
[31] Lenwood S. Heath and John P. C. Vergara. Sorting by Bounded Block-moves. Discrete Applied Mathematics, 88(1-3):181--206, 1998. [ bib ]
[32] Jonathan A. Eisen. Phylogenomics: Improving Functional Predictions for Uncharacterized Genes by Evolutionary Analysis. Genome Research, 8:163--167, 1998. [ bib ]
[33] David Sankoff and Mathieu Blanchette. Multiple Genome Rearrangement and Breakpoint Phylogeny. Journal of Computational Biology, 5(3):555--70, 1998. [ bib ]
[34] Maria E. M. T. Walter. Algoritmos para Problemas em Rearranjo de Genomas. PhD thesis, Institute of Computing, University of Campinas, 1999. In Portuguese. [ bib ]
[35] Alberto Caprara. Sorting Permutations by Reversals and Eulerian Cycle Decompositions. SIAM Journal on Discrete Mathematics, 12(1):91--110, 1999. [ bib ]
[36] Sridhar Hannenhalli and Pavel A. Pevzner. Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting Signed Permutations by Reversals. Journal of the ACM, 46(1):1--27, 1999. [ bib ]
[37] Qian-Ping Gu, Shietung Peng, and Ivan H. Sudborough. A 2-Approximation Algorithm for Genome Rearrangements by Reversals and Transpositions. Theoretical Computer Science, 210(2):327--339, 1999. [ bib ]
[38] Piotr Berman and Marek Karpinski. On Some Tighter Inapproximability Results (Extended Abstract). In J. Wiedermann, P. E. Boas, and M. Nielsen, editors, Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICAL'1999), volume 1644 of Lecture Notes in Computer Science, pages 200--209. Springer-Verlag, London, UK, 1999. [ bib ]
[39] Alberto Caprara, Giuseppe Lancia, and See K. Ng. A Column-generation Based Branch-and-bound Algorithm for Sorting by Reversals. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 47:213--226, 1999. [ bib ]
[40] Maria E. M. T. Walter, Zanoni Dias, and João Meidanis. A New Approach for Approximating The Transposition Distance. In F. M. Titsworth, editor, Proceedings of the 7th String Processing and Information Retrieval (SPIRE'2000), pages 199--208, Los Alamitos, CA, USA, 2000. IEEE Computer Society. [ bib ]
[41] Alberto Caprara, Giuseppe Lancia, and See K. Ng. Fast Practical Solution of Sorting by Reversals. In D. Shmoys, editor, Proceedings of the 11th ACM-SIAM Annual Symposium on Discrete Algorithms (SODA'2000), pages 12--21, Philadelphia, PA, USA, 2000. Society for Industrial and Applied Mathematics. [ bib ]
[42] João Meidanis and Zanoni Dias. An Alternative Algebraic Formalism for Genome Rearrangements. In D. Sankoff and J. H. Nadeau, editors, Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment and Evolution of Gene Families, volume 1, pages 213--223. Springer Science+Business Media, Dordrecht, Netherlands, 2000. [ bib ]
[43] João Meidanis, Maria E. M. T. Walter, and Zanoni Dias. Reversal Distance of Signed Circular Chromosomes. Technical Report IC-00-23, Institute of Computing, University of Campinas, 2000. [ bib ]
[44] João Meidanis, Maria E. M. T. Walter, and Zanoni Dias. A Lower Bound on the Reversal and Transposition Diameter. Technical Report IC-00-16, Institute of Computing, University of Campinas, 2000. [ bib ]
[45] Jonathan A. Eisen, John F. Heidelberg, Owen White, and Steven L. Salzberg. Evidence for Symmetric Chromosomal Inversions Around the Replication Origin in Bacteria. Genome Biology, 1(6):research0011.1--0011.9, 2000. [ bib ]
[46] Lenwood S. Heath and John Paul C. Vergara. Sorting by Short Block-Moves. Algorithmica, 28(3):323--352, 2000. [ bib ]
[47] Henrik Eriksson, Kimmo Eriksson, Johan Karlander, Lars Svensson, and Johan Wastlund. Sorting a Bridge Hand. Discrete Mathematics, 241(1-3):289--300, 2001. [ bib ]
[48] David A. Bader, Bernard M. E. Moret, and Mi Yan. A Linear-Time Algorithm for Computing Inversion Distance Between Signed Permutations with an Experimental Study. Journal of Computational Biology, 8:483--491, 2001. [ bib ]
[49] David A. Christie and Robert W. Irving. Sorting Strings by Reversals and by Transpositions. SIAM Journal on Discrete Mathematics, 14(2):193--206, 2001. [ bib ]
[50] Guo-Hui Lin and Guoliang Xue. Signed Genome Rearrangement by Reversals and Transpositions: Models and Approximations. Theoretical Computer Science, 259(1-2):513--531, 2001. [ bib ]
[51] Zanoni Dias and João Meidanis. Genome Rearrangements Distance by Fusion, Fission, and Transposition is Easy. In B. Werner, editor, Proceedings of the 8th String Processing and Information Retrieval (SPIRE'2001), pages 250--253, Los Alamitos, CA, USA, 2001. IEEE Computer Society. [ bib ]
[52] Bernard M. Moret, Li-San. Wang, Tandy Warnow, and Stacia K. Wyman. New Approaches for Reconstructing Phylogenies from Gene Order Data. Bioinformatics, 17 Suppl 1:S165--S173, 2001. [ bib ]
[53] Alberto Caprara, Giuseppe Lancia, and See-Kiong Ng. Sorting Permutations by Reversals Through Branch-and-Price. INFORMS Journal on Computing, 13(3):224--244, 2001. [ bib ]
[54] Zanoni Dias. Rearranjo de Genomas: Uma Coletânea de Artigos. PhD thesis, University of Campinas, Institute of Computing, 2002. In Portuguese. [ bib ]
[55] Zanoni Dias and João Meidanis. Sorting by Prefix Transpositions. In A. H. F. Laender and A. L. Oliveira, editors, Proceedings of the 9th International Symposium on String Processing and Information Retrieval (SPIRE'2002), volume 2476 of Lecture Notes in Computer Science, pages 65--76. Springer-Verlag Berlin Heidelberg New York, Berlin/Heidelberg, Germany, 2002. [ bib ]
[56] Zanoni Dias and João Meidanis. The Genome Rearrangement Distance Problem with Arbitrary Weights. Technical Report IC-02-01, Institute of Computing, University of Campinas, 2002. [ bib ]
[57] Piotr Berman, Sridhar Hannenhalli, and Marek Karpinski. 1.375-Approximation Algorithm for Sorting by Reversals. In R. Möhring and R. Raman, editors, Proceedings of the 10th Annual European Symposium on Algorithms (ESA'2002), volume 2461 of Lecture Notes in Computer Science, pages 200--210. Springer-Verlag Berlin Heidelberg New York, Berlin/Heidelberg, Germany, 2002. [ bib ]
[58] João Meidanis, Maria E. M. T. Walter, and Zanoni Dias. A Lower Bound on the Reversal and Transposition Diameter. Journal of Computational Biology, 9(5):743--745, 2002. [ bib ]
[59] Ron Y. Pinter and Steven Skiena. Genomic Sorting with Length-Weighted Reversals. Genome Informatics, 13:2002, 2002. [ bib ]
[60] Niklas Eriksen. (1+ε)-Approximation of Sorting by Reversals and Transpositions. Theoretical Computer Science, 289(1):517--529, 2002. [ bib ]
[61] Alberto Caprara and Romeo Rizzi. Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals. Journal of Combinatorial Optimization, 6(2):157--182, 2002. [ bib ]
[62] Guillaume Bourque and Pavel A. Pevzner. Genome-scale Evolution: Reconstructing Gene Orders in the Ancestral Species. Genome Research, 12(1):26--36, 2002. [ bib ]
[63] Yasmine Ajana, Jean-François Lefebvre, Elisabeth R. M. Tillier, and Nadia El-Mabrouk. Exploring the Set of All Minimal Sequences of Reversals - An Application to Test the Replication-directed Reversal Hypothesis. In R. Guigó and D. Gusfield, editors, Proceedings of the 2nd International Workshop on Algorithms in Bioinformatics (WABT'2002), volume 2452 of Lecture Notes in Computer Science, pages 300--315. Springer-Verlag Berlin Heidelberg, Heidelberg, Germany, 2002. [ bib ]
[64] Glenn Tesler. GRIMM: Genome Rearrangements Web Server. Bioinformatics, 18(3):492--493, 2002. [ bib ]
[65] Adam C. Siepel. An Algorithm to Enumerate All Sorting Reversals. In G. Myers, S. Hannenhalli, D. Sankoff, S. Istrail, P. Pevzner, and M. Waterman, editors, Proceedings of the 6th Annual International Conference on Computational Biology (RECOMB'2002), pages 281--290, New York, NY, USA, 2002. ACM. [ bib ]
[66] Douglas W. Bass and Ivan H. Sudborough. Pancake Problems with Restricted Prefix Reversals and some Corresponding Cayley Networks. Journal of Parallel and Distributed Computing, 63(3):327--336, 2003. [ bib ]
[67] Maria E. M. T. Walter, Luiz R. A. F. Curado, and Adilton G. Oliveira. Working on the Problem of Sorting by Transpositions on Genome Rearrangements. In R. Baeza-Yates, E. Chávez, and M. Crochemore, editors, Proceedings of the 14th Annual Symposium on Combinatorial Pattern Matching (CPM'2003), volume 2676 of Lecture Notes in Computer Science, pages 372--383. Springer Berlin Heidelberg, Berlin/Heidelberg, Germany, 2003. [ bib ]
[68] Guillaume Achaz, Eric Coissac, Pierre Netter, and Eduardo P. C. Rocha. Associations Between Inverted Repeats and the Structural Evolution of Bacterial Genomes. Genetics, 164(4):1279--1289, 2003. [ bib ]
[69] Lenwood S. Heath and John Paul C. Vergara. Sorting by Short Swaps. Journal of Computational Biology, 10(5):775--789, 2003. [ bib ]
[70] Guohui Lin and Tao Jiang. A Further Improved Approximation Algorithm for Breakpoint Graph Decomposition. Journal of Combinatorial Optimization, 8(2):183--194, 2004. [ bib ]
[71] Firas Swidan, Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, and Ron Y. Pinter. Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity. In S. Sahinalp, S. Muthukrishnan, and U. Dogrusoz, editors, Combinatorial Pattern Matching, volume 3109 of Lecture Notes in Computer Science, pages 32--46. Springer Berlin Heidelberg, Heidelberg, Germany, 2004. [ bib ]
[72] Aaron E. Darling, Bob Mau, Frederick R. Blattner, and Nicole T. Perna. Mauve: Multiple Alignment of Conserved Genomic Sequence with Rearrangements. Genome Research, 14(7):1394--1403, 2004. [ bib ]
[73] M. I. Honda. Implementation of the Algorithm of Hartman for the Problem of Sorting by Transpositions. Master's thesis, Department of Computer Science, University of Brasilia, Brazil, 2004. [ bib ]
[74] Eric Tannier and Marie-France Sagot. Sorting by Reversals in Subquadratic Time. In S. C. Sahinalp, S. Muthukrishnan, and U. Dogrusoz, editors, Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching (CPM'2004), volume 3109 of Lecture Notes in Computer Science, pages 1--13, Berlin/Heidelberg, Germany, 2004. Springer Berlin Heidelberg. [ bib ]
[75] Marek Chrobak, Petr Kolman, and Jiří Sgall. The Greedy Algorithm for the Minimum Common String Partition Problem. In K. Jansen, S. Khanna, J. D. P. Rolim, and D Ron, editors, Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'2004), and 8th International Workshop on Randomization and Computation (RANDOM'2004), pages 84--95, Berlin, Heidelberg, 2004. Springer Berlin Heidelberg. [ bib ]
[76] Johannes Fischer and Simon W. Ginzinger. A 2-Approximation Algorithm for Sorting by Prefix Reversals. In G. S. Brodal and S. Leonardi, editors, Proceedings of the 13th Annual European Conference on Algorithms (ESA'2005), volume 3669 of Lecture Notes in Computer Science, pages 415--425, Berlin, Heidelberg, 2005. Springer Berlin Heidelberg. [ bib ]
[77] Anne Bergeron. A Very Elementary Presentation of the Hannenhalli-Pevzner Theory. Discrete Applied Mathematics, 146(2):134--145, 2005. [ bib ]
[78] Tzvika Hartman and Roded Sharan. A 1.5-Approximation Algorithm for Sorting by Transpositions and Transreversals. Journal of Computer and System Sciences, 70(3):300--320, 2005. [ bib ]
[79] Anthony Labarre. A New Tight Upper Bound on the Transposition Distance. In R. Casadio and G. Myers, editors, Proceedings of the 5th International Conference on Algorithms in Bioinformatics (WABI'2005), volume 3692 of Lecture Notes in Computer Science, pages 216--227, Berlin, Heidelberg, 2005. Springer Berlin Heidelberg. [ bib ]
[80] Thach C. Nguyen, Hieu T. Ngo, and Nguyen B. Nguyen. Sorting by Restricted-Length-Weighted Reversals. Genomics Proteomics & Bioinformatics, 3(2):120--127, 2005. [ bib ]
[81] Guillaume Blin and Romeo Rizzi. Conserved Interval Distance Computation Between Non-trivial Genomes. In L. Wang, editor, Computing and Combinatorics, volume 3595 of Lecture Notes in Computer Science, pages 22--31. Springer Berlin Heidelberg, Heidelberg, Germany, 2005. [ bib ]
[82] Andrew J. Radcliffe, Alex D. Scott, and Elizabeth L. Wilmer. Reversals and Transpositions Over Finite Alphabets. SIAM Journal on Discrete Mathematics, 19(1):224--244, 2005. [ bib ]
[83] Vinicius J. Fortuna. Distâncias de Transposição entre Genomas. Master's thesis, Institute of Computing, University of Campinas, 2005. In Portuguese. [ bib ]
[84] Bret Larget, Donald L. Simon, Joseph B. Kadane, and Deborah Sweet. A Bayesian Analysis of Metazoan Mitochondrial Genome Arrangements. Molecular Biology and Evolution, 22(3):486--95, 2005. [ bib ]
[85] Maria E. M. T. Walter, Mauro C. Sobrinho, Eugenia T. G. Oliveira, Lorena S. Soares, Adilton G. Oliveira, Thelmo E. S. Martins, and Tiago M. Fonseca. Improving the Algorithm of Bafna and Pevzner for the Problem of Sorting by Transpositions: a Practical Approach. Discrete Algorithm, 3:342--361, 2005. [ bib ]
[86] Enno Ohlebusch, Mohamed I. Abouelhoda, Kathrin Hockel, and Jan Stallkamp. The Median Problem for the Reversal Distance in Circular Bacterial Genomes. In A. Apostolico, M. Crochemore, and K. Park, editors, Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching (CPM'2005), volume 3537 of Lecture Notes in Computer Science, pages 116--127, Heidelberg, Germany, 2005. Springer Berlin Heidelberg. [ bib ]
[87] Avraham Goldstein, Petr Kolman, and Jie Zheng. Minimum Common String Partition Problem: Hardness and Approximations. In R. Fleischer and G. Trippen, editors, Proceedings of the 15th International Symposium on Algorithms and Computation (ISAAC'2004), pages 484--495, Berlin, Heidelberg, 2005. Springer Berlin Heidelberg. [ bib ]
[88] Xin Chen, Jie Zheng, Zheng Fu, Peng Nan, Yang Zhong, Stefano Lonardi, and Tao Jiang. Assignment of Orthologous Genes via Genome Rearrangement. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2(4):302--315, 2005. [ bib ]
[89] Isaac Elias and Tzvika Hartman. A 1.375-Approximation Algorithm for Sorting by Transpositions. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 3(4):369--379, 2006. [ bib ]
[90] Anthony Labarre. New Bounds and Tractable Instances for the Transposition Distance. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 3(4):380--394, 2006. [ bib ]
[91] Matthias Bernt, Daniel Merkle, and Martin Middendorf. Genome Rearrangement Based on Reversals that Preserve Conserved Intervals. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 3(3):275--288, 2006. [ bib ]
[92] Tzvika Hartman and Ron Shamir. A Simpler and Faster 1.5-approximation Algorithm for Sorting by Transpositions. Journal Information and Computation, 204(2):275--290, 2006. [ bib ]
[93] Yijie Han. Improving the Efficiency of Sorting by Reversals. In H. R. Arabnia and H. Valafar, editors, Proceedings of the 2006 International Conference on Bioinformatics & Computational Biology (BIOCOMP'2006), pages 635--646. CSREA Press, 2006. [ bib ]
[94] Haim Kaplan and Nira Shafrir. The Greedy Algorithm for Edit Distance with Moves. Information Processing Letters, 97(1):23--27, 2006. [ bib ]
[95] Cor Hurkens, Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie, and John Tromp. Prefix Reversals on Binary and Ternary Strings. SIAM Journal on Discrete Mathematics, 21(3):592--611, 2007. [ bib ]
[96] Martin Bader and Enno Ohlebusch. Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions. Journal of Computational Biology, 14(5):615--636, 2007. [ bib ]
[97] Cleber V. G. Mira. Análise Algébrica de Rearranjo em Genomas -- Algoritmos e Complexidade. PhD thesis, Institute of Computing, University of Campinas, 2007. In Portuguese. [ bib ]
[98] Eric Tannier, Anne Bergeron, and Marie-France Sagot. Advances on Sorting by Reversals. Discrete Applied Mathematics, 155(6-7):881--888, 2007. [ bib ]
[99] Sèverine Bérard, Anne Bergeron, Cedric Chauve, and Christophe Paul. Perfect Sorting by Reversals is not Always Difficult. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 4(1):4--16, 2007. [ bib ]
[100] Daniel W. Cranston, Ivan H. Sudborough, and Douglas B. West. Short Proofs for Cut-and-Paste Sorting of Permutations. Discrete Mathematics, 307(22):2866--2870, 2007. [ bib ]
[101] Maxime Benoît-Gagné and Sylvie Hamel. A New and Faster Method of Sorting by Transpositions. In B. Ma and Kaizhong Zhang, editors, Proceedings of the 18th Annual Conference on Combinatorial Pattern Matching (CPM'2007), volume 4580 of Lecture Notes in Computer Science, pages 131--141, Heidelberg, Germany, 2007. Springer Berlin Heidelberg. [ bib ]
[102] J. Feng and D. Zhu. Faster Algorithms for Sorting by Transpositions and Sorting by Block Interchanges. ACM Transactions on Algorithms, 3(3):25, 2007. [ bib ]
[103] Zanoni Dias and Cid C. de Souza. Polynomial-sized ILP Models for Rearrangement Distance Problems. In M.-F. Sagot and M. E. M. T. Walter, editors, Proceedings of the 3rd Brazilian Symposium on Bioinformatics (BSB'2007), pages 74--85, Angra dos Reis, Brasil, 2007. [ bib ]
[104] Petr Kolman and Tomasz Waleń. Approximating Reversal Distance for Strings with Bounded Number of Duplicates. Discrete Applied Mathematics, 155(3):327--336, 2007. [ bib ]
[105] Petr Kolman and Tomasz Waleń. Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set. In T. Erlebach and C. Kaklamanis, editors, Proceedings of the 4th International Workshop on Approximation and Online Algorithms (WAOA'2006), pages 279--289, Berlin, Heidelberg, 2007. Springer Berlin Heidelberg. [ bib ]
[106] Dan He. A Novel Greedy Algorithm for the Minimum Common String Partition Problem. In I. Măndoiu and A. Zelikovsky, editors, Proceedings on the 3rd International Symposium on Bioinformatics Research and Applications (ISBRA'2007), pages 441--452, Berlin, Heidelberg, 2007. Springer Berlin Heidelberg. [ bib ]
[107] Atif Rahman, Swakkhar Shatabda, and Masud Hasan. An Approximation Algorithm for Sorting by Reversals and Transpositions. Journal of Discrete Algorithms, 6(3):449--457, 2008. [ bib ]
[108] Karmella A. Haynes, Marian L. Broderick, Adam D. Brown, Trevor L. Butner, James O. Dickson, W. L. Harden, Lane H. Heard, Eric L. Jessen, Kelly J. Malloy, Brad J. Ogden, Sabriya Rosemond, Samantha Simpson, Erin Zwack, A. M. Campbell, Todd T. Eckdahl, Laurie J. Heyer, and Jeffrey L. Poet. Engineering Bacteria to Solve the Burnt Pancake Problem. Journal of Biological Engineering, 2:1--12, 2008. [ bib ]
[109] Anthony Labarre. Edit Distances and Factorisations of Even Permutations. In D. Halperin and K. Mehlhorn, editors, Proceedings of the 16th Annual European Symposium on Algorithms (ESA'2008), volume 5193 of Lecture Notes in Computer Science, pages 635--646, Berlin, Heidelberg, 2008. Springer-Verlag. [ bib ]
[110] Martin Bader, Mohamed I. Abouelhoda, and Enno Ohlebusch. A Fast Algorithm for the Multiple Genome Rearrangement Problem with Weighted Reversals and Transpositions. BMC Bioinformatics, 9(1):1--13, 2008. [ bib ]
[111] Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter, Steven S. Skiena, and Firas Swidan. Improved Bounds on Sorting by Length-Weighted Reversals. Journal of Computer and System Sciences, 74(5):744--774, 2008. [ bib ]
[112] Elena Konstantinova. Some Problems on Cayley Graphs. Linear Algebra and its Applications, 429(11-12):2754--2769, 2008. [ bib ]
[113] Rodrigo A. Hausen, Luerbio Faria, Celina M. H. Figueiredo, and Luis A. B. Kowada. On the Toric Graph as a Tool to Handle the Problem of Sorting by Transpositions. In A. L. C. Bazzan, M. Craven, and N. F. Martins, editors, Proceedings of the 3rd Brazilian Symposium on Bioinformatics (BSB'2008), volume 5167 of Lecture Notes in Computer Science, pages 79--91, Heidelberg, Germany, 2008. Springer Berlin Heidelberg. [ bib ]
[114] Cleber V. G. Mira, Zanoni Dias, Hederson P. Santos, Guilherme A. Pinto, and Maria E. M. T. Walter. Transposition Distance Based on the Algebraic Formalism. In A. L. C. Bazzan, M. Craven, and N. F. Martins, editors, Proceedings of the 3rd Brazilian Symposium on Bioinformatics (BSB'2008), volume 5167 of Lecture Notes in Computer Science, pages 115--126, Heidelberg, Germany, 2008. Springer Berlin Heidelberg. [ bib ]
[115] Aaron E. Darling, István Miklós, and Mark A. Ragan. Dynamics of Genome Rearrangement in Bacterial Populations. PLoS Genetics, 4(7):e1000128, 2008. [ bib ]
[116] Bhadrachalam Chitturi, William Fahle, Z. Meng, Linda Morales, Charles O. Shields, Ivan H. Sudborough, and Walter Voit. An (18/11)n Upper Bound for Sorting by Prefix Reversals. Theoretical Computer Science, 410(36):3372--3390, 2009. [ bib ]
[117] Guillaume Fertin, Anthony Labarre, Irena Rusu, Éric Tannier, and Stéphane Vialette. Combinatorics of Genome Rearrangements. Computational Molecular Biology. The MIT Press, London, England, 2009. [ bib ]
[118] Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms. The MIT Press, London, England, 3rd edition, 2009. [ bib ]
[119] Ying C. Lin, Chun-Yuan Lin, and Chunhung R. Lin. Sorting by Reversals and Block-Interchanges with Various Weight Assignments. BMC Bioinformatics, 10(1):398, 2009. [ bib ]
[120] Ulisses Dias and Zanoni Dias. Constraint Programming Models for Transposition Distance Problem. In Proceedings of the 4th Brazilian Symposium on Bioinformatics (BSB'2009), volume 5676 of Lecture Notes in Computer Science, pages 13--23. Springer Berlin Heidelberg, Heidelberg, Germany, 2009. [ bib ]
[121] Christian Baudet. Enumeração de Traces e Identificação de Breakpoints: Estudo de Aspectos da Evolução. PhD thesis, Institute of Computing, University of Campinas, 2010. In Portuguese. [ bib ]
[122] Mahfuza Sharmin, Rukhsana Yeasmin, Masud Hasan, Atif Rahman, and Mohammad S. Rahman. Pancake Flipping with Two Spatulas. Electronic Notes in Discrete Mathematics, 36:231--238, 2010. [ bib ]
[123] Aaron Williams. O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List. In P. Boldi and L. Gargano, editors, Proceedings of the 5th International Conference on Fun with Algorithms (FUN'2010), volume 6099 of Lecture Notes in Computer Science, pages 368--379, Berlin, Heidelberg, 2010. Springer-Verlag. [ bib ]
[124] Malte Helmert. Landmark Heuristics for the Pancake Problem. In N. Sturtevant and A. Felner, editors, Proceedings of the 3rd Annual Symposium on Combinatorial Search (SOCS'2010), pages 109--110. AAAI Press, 2010. [ bib ]
[125] Xiao-Wen Lou and Da-Ming Zhu. Sorting Unsigned Permutations by Weighted Reversals, Transpositions, and Transreversals. Journal of Computer Science and Technology, 25(4):853--863, 2010. [ bib ]
[126] Krister M. Swenson, Ghada Badr, and David Sankoff. Listing All Sorting Reversals in Quadratic Time. In V. Moulton and M. Singh, editors, Algorithms in Bioinformatics, volume 6293 of Lecture Notes in Computer Science, pages 102--110. Springer Berlin Heidelberg, Heidelberg, Germany, 2010. [ bib ]
[127] Krister M. Swenson, Vaibhav Rajan, Yu Lin, and Bernard M. E. Moret. Sorting Signed Permutations by Inversions in O(n logn) time. Journal of Computational Biology, 17(3):489--501, 2010. [ bib ]
[128] Mohammad T. Alam, Maria E. Merlo, Eriko Takano, and Rainer Breitling. Genome-based Phylogenetic Analysis of Streptomyces and its Relatives. Molecular Phylogenetics and Evolution, 54:763--772, 2010. [ bib ]
[129] Ulisses Dias and Zanoni Dias. (4,3)-Sequences for two Oriented Cycles that do not Lead to a Valid 2-move. http://www.ic.unicamp.br/~udias/DD2010a/proof1/index.html, 2010. [ bib ]
[130] Ulisses Dias and Zanoni Dias. SIB - Symmetric Inversion in Bacteria. http://www.ic.unicamp.br/~zanoni/sib, 2010. [ bib ]
[131] Ulisses Dias and Zanoni Dias. Extending Bafna-Pevzner Algorithm. In Proceedings of the 1st International Symposium on Biocomputing (ISB'2010), pages 1--8, New York, NY, USA, 2010. ACM. [ bib ]
[132] Ulisses Dias and Zanoni Dias. An Improved 1.375-approximation Algorithm for the Transposition Distance Problem. In Proceeding of the 1st ACM International Conference on Bioinformatics and Computational Biology (BCB'2010), pages 334--337, New York, NY, USA, 2010. ACM. [ bib ]
[133] Josef Cibulka. On Average and Highest Number of Flips in Pancake Sorting. Theoretical Computer Science, 412(8-10):822--834, 2011. [ bib ]
[134] Anthony Labarre and Josef Cibulka. Polynomial-Time Sortable Stacks of Burnt Pancakes. Theoretical Computer Science, 412(8-10):695--702, 2011. [ bib ]
[135] Gustavo R. Galvão and Zanoni Dias. Computing Rearrangement Distance of Every Permutation in the Symmetric Group. In W. C. Chu, W. E. Wong, M. J. Palakal, and C.-C. Hung, editors, Proceedings of the 26th ACM Symposium on Applied Computing (SAC'2011), pages 106--107, New York, NY, USA, 2011. ACM. [ bib ]
[136] Gustavo R. Galvão and Zanoni Dias. Rearrangement Distance Database and Genome Rearrangement Algorithm Auditor (GRAAu). http://mirza.ic.unicamp.br:8080, 2011. [ bib ]
[137] Ulisses Dias, Zanoni Dias, and Joã C. Setubal. Evaluation of Genome Distance Measures using Tree-derived Distances. In O. N. de Souza G. P. Telles and M. J. Palakal, editors, Proceedings of the 6th Brazilian Symposium on Bioinformatics (BSB'2011), pages 73--76, 2011. [ bib ]
[138] Gustavo R. Galvão and Zanoni Dias. On the Distribution of Rearrangement Distances. In O. N. de Souza G. P. Telles and M. J. Palakal, editors, Proceedings of the 6th Brazilian Symposium on Bioinformatics (BSB'2011), pages 41--48, 2011. [ bib ]
[139] Ulisses Dias, Zanoni Dias, and Joã C. Setubal. Two New Whole-genome Distance Measures. In O. N. de Souza G. P. Telles and M. J. Palakal, editors, Proceedings of the 6th Brazilian Symposium on Bioinformatics (BSB'2011), pages 61--64, 2011. [ bib ]
[140] Ulisses Dias, Zanoni Dias, and Joã C. Setubal. Using Inversion Signatures to Generate Draft Genome Sequence Scaffolds. In Proceeding of the 2nd ACM International Conference on Bioinformatics and Computational Biology (BCB'2011), pages 39--48, New York, NY, USA, 2011. ACM. [ bib ]
[141] Ulisses Dias, Zanoni Dias, and Joã C. Setubal. A Simulation Tool for the Study of Symmetric Inversions in Bacterial Genomes. In Comparative Genomics, volume 6398 of Lecture Notes in Computer Science, pages 240--251. Springer-Verlag, Berlin, Germany, 2011. [ bib ]
[142] Laurent Bulteau, Guillaume Fertin, and Irena Rusu. Sorting by Transpositions is Difficult. SIAM Journal on Computing, 26(3):1148--1180, 2012. [ bib ]
[143] Bhadrachalam Chitturi and Ivan H. Sudborough. Bounding Prefix Transposition Distance for Strings and Permutations. Theoretical Computer Science, 421:15--24, 2012. [ bib ]
[144] Ulisses Martins Dias. Problemas de Comparação de Genomas. PhD thesis, Institute of Computing, University of Campinas, 2012. In Portuguese. [ bib ]
[145] Gustavo Rodrigues Galvão. Uma Ferramenta de Auditoria para Algoritmos de Rearranjo de Genomas. Master's thesis, Institute of Computing, University of Campinas, 2012. In Portuguese. [ bib ]
[146] Zanoni Dias, Ulisses Dias, Lenwood S. Heath, and Jo ao C. Setubal. Sorting Genomes Using Almost-Symmetric Inversions. In Proceedings of the 27th Annual ACM Symposium on Applied Computing (SAC'2012), pages 1368--1374, New York, NY, USA, 2012. ACM. [ bib ]
[147] Gustavo R. Galvão and Zanoni Dias. On the Performance of Sorting Permutations by Prefix Operations. In F. Saeed, editor, Proceedings of the 4th International Conference on Bioinformatics and Computational Biology (BICoB'2012), pages 102--107. International Society for Computers and their Applications, 2012. [ bib ]
[148] Gustavo R. Galvão and Zanoni Dias. GRAAu: Genome Rearrangement Algorithm Auditor. In F. Saeed, editor, Proceedings of the 4th International Conference on Bioinformatics and Computational Biology (BICoB'2012), pages 97--101. International Society for Computers and their Applications, 2012. [ bib ]
[149] Haitao Jiang, Binhai Zhu, and Daming Zhu Hong Zhu. Minimum Common String Partition Revisited. Journal of Combinatorial Optimization, 23(4):519--527, 2012. [ bib ]
[150] Haitao Jiang, Daming Zhu, and Binhai Zhu. A (1+e)-Approximation Algorithm for Sorting by Short Block-Moves. Theoretical Computer Science, 437:1--8, 2012. [ bib ]
[151] Xin Chen. On Sorting Unsigned Permutations by Double-Cut-and-Joins. Journal of Combinatorial Optimization, 25(3):339--351, 2013. [ bib ]
[152] Luís F. I. Cunha, Luis A. B. Kowada, Rodrigo de A. Hausen, and Celina M. H. de Figueiredo. On the 1.375-Approximation Algorithm for Sorting by Transpositions in O(n log n) Time. In J. C. Setubal and N. F. Almeida, editors, Advances in Bioinformatics and Computational Biology, volume 8213 of Lecture Notes in Computer Science, pages 126--135. Springer International Publishing, Switzerland, 2013. [ bib ]
[153] Thiago da S. Arruda, Ulisses Dias, and Zanoni Dias. Heuristics for the Sorting by Length-Weighted Inversion Problem. In A.-H. Dediu, C. Martín-Vide, and B. Truthe, editors, Proceedings of the 4th International Conference on Bioinformatics, Computational Biology and Biomedical Informatics (BCB'2013), volume 8542 of Lecture Notes in Computer Science, pages 498:498--498:507, New York, NY, USA, 2013. ACM. [ bib ]
[154] Amit K. Dutta, Masud Hasan, and Mohammad S. Rahman. Prefix Transpositions on Binary and Ternary Strings. Information Processing Letters, 113(8):265--270, 2013. [ bib ]
[155] Ulisses Dias and Zanoni Dias. Heuristics for the Transposition Distance Problem. Journal of Bioinformatics and Computational Biology, 11(5):17, 2013. [ bib ]
[156] Ulisses Dias, Christian Baudet, and Zanoni Dias. Greedy Randomized Search Procedure to Sort Genomes Using Symmetric, Almost-Symmetric and Unitary Inversions. In A.-H. Dediu, C. Martín-Vide, and B. Truthe, editors, Proceedings of the 4th International Conference on Bioinformatics, Computational Biology and Biomedical Informatics (BCB'2013), volume 8542 of Lecture Notes in Computer Science, pages 181--190, New York, NY, USA, 2013. ACM. [ bib ]
[157] Ulisses Dias and Zanoni Dias. Sorting Genomes using Symmetric, Almost-symmetric and Unitary Inversions. In Proceedings of the 5th International Conference on Bioinformatics and Computational Biology (BICoB'2013), pages 261--268, 2013. [ bib ]
[158] Carla N. Lintzmayer and Zanoni Dias. Sorting Permutations by Prefix and Suffix Versions of Reversals and Transpositions. In A. Pardo and A. Viola, editors, LATIN 2014: Theoretical Informatics, volume 8392 of Lecture Notes in Computer Science, pages 671--682. Springer Berlin Heidelberg, Heidelberg, Germany, 2014. [ bib ]
[159] Carla N. Lintzmayer and Zanoni Dias. On Sorting of Signed Permutations by Prefix and Suffix Reversals and Transpositions. In A.-H. Dediu, C. Martín-Vide, and B. Truthe, editors, Algorithms for Computational Biology, volume 8542 of Lecture Notes in Computer Science, pages 146--157. Springer International Publishing, Switzerland, 2014. [ bib ]
[160] Carla N. Lintzmayer and Zanoni Dias. On the Diameter of Rearrangement Problems. In A.-H. Dediu, C. Martín-Vide, and B. Truthe, editors, Algorithms for Computational Biology, volume 8542 of Lecture Notes in Computer Science, pages 158--170. Springer International Publishing, Switzerland, 2014. [ bib ]
[161] Thiago da S. Arruda, Ulisses Dias, and Zanoni Dias. Heuristics for the Sorting by Length-Weighted Inversions Problem on Signed Permutations. In A.-H. Dediu, C. Martín-Vide, and B. Truthe, editors, Algorithms for Computational Biology, volume 8542 of Lecture Notes in Computer Science, pages 59--70. Springer International Publishing, Switzerland, 2014. [ bib ]
[162] Christian Baudet, Ulisses Dias, and Zanoni Dias. Length and Symmetry on the Sorting by Weighted Inversions Problem. In S. Campos, editor, Advances in Bioinformatics and Computational Biology, volume 8826 of Lecture Notes in Computer Science, pages 99--106. Springer International Publishing, Switzerland, 2014. [ bib ]
[163] Laurent Bulteau, Guillaume Fertin, and Christian Komusiewicz. Reversal Distances for Strings with Few Blocks or Small Alphabets. In A. S. Kulikov, S. O. Kuznetsov, and P. A. Pevzner, editors, Combinatorial Pattern Matching, volume 8486 of Lecture Notes in Computer Science, pages 50--59. Springer International Publishing, Switzerland, 2014. [ bib ]
[164] Ulisses Dias, Gustavo R. Galvão, Carla N. Lintzmayer, and Zanoni Dias. A General Heuristic for Genome Rearrangement Problems. Journal of Bioinformatics and Computational Biology, 12(3):26, 2014. [ bib ]
[165] Anke van Zuylen James Bieron, Frans Schalekamp, and Gexin Yu. An Upper Bound on the Number of Circular Transpositions to Sort a Permutation. http://arxiv.org/abs/1402.4867, 2014. [ bib ]
[166] Ulisses Dias, Andre R. Oliveira, and Zanoni Dias. An Improved Algorithm for the Sorting by Reversals and Transpositions Problem. In Proceedings of the 5th ACM Conference on Bioinformatics, Computational Biology, and Health Informatics (BCB'2014), pages 400--409, New York, NY, USA, 2014. ACM. [ bib ]
[167] Isaac Goldstein and Moshe Lewenstein. Quick Greedy Computation for Minimum Common String Partition. Theoretical Computer Science, 542:98--107, 2014. [ bib ]
[168] Haitao Jiang, Haodi Feng, and Daming Zhu. An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves. In H. Ahn and C. Shin, editors, Proceedings of the 25th International Symposium on Algorithms and Computation (ISAAC'2014), Lecture Notes in Computer Science, pages 491--503. Springer International Publishing, 2014. [ bib ]
[169] Gustavo R. Galvão and Zanoni Dias. An Audit Tool for Genome Rearrangement Algorithms. Journal of Experimental Algorithmics, 19:1--34, 2014. [ bib ]
[170] Gustavo Rodrigues Galvão and Zanoni Dias. Approximation Algorithms for Sorting by Signed Short Reversals. In Proceedings of the 5th ACM Conference on Bioinformatics, Computational Biology, and Health Informatics (BCB'2014), pages 360--369, New York, NY, USA, 2014. ACM. [ bib ]
[171] Zanoni Dias and Ulisses Dias. Sorting by Prefix Reversals and Prefix Transpositions. Discrete Applied Mathematics, 181:78--89, 2015. [ bib ]
[172] Gustavo R. Galvão, Orlando Lee, and Zanoni Dias. Sorting Signed Permutations by Short Operations. Algorithms for Molecular Biology, 10(1):1--17, 2015. [ bib ]
[173] Gustavo R. Galvão, Christian Baudet, and Zanoni Dias. Sorting Signed Circular Permutations by Super Short Reversals. In R. Harrison, Y. Li, and I. Măndoiu, editors, Proceedings of the 11th International Symposium on Bioinformatics Research and Applications (ISBRA'2015), Lecture Notes in Computer Science, pages 272--283. Springer International Publishing, Switzerland, 2015. [ bib ]
[174] Md. K. Rahman and Mohammad S. Rahman. Prefix and Suffix Transreversals on Binary and Ternary Strings. Journal of Discrete Algorithms, 33:160--170, 2015. [ bib ]
[175] Masud Hasan, Atif Rahman, Md. K. Rahman, Mohammad S. Rahman, Mahfuza Sharmin, and Rukhsana Yeasmin. Pancake Flipping and Sorting Permutations. Journal of Discrete Algorithms, 33:139--149, 2015. [ bib ]
[176] Carla N. Lintzmayer, Guillaume Fertin, and Zanoni Dias. Approximation Algorithms for Sorting by Length-Weighted Prefix and Suffix Operations. Theoretical Computer Science, 593:26--41, 2015. [ bib ]
[177] Laurent Bulteau, Guillaume Fertin, and Irena Rusu. Pancake Flipping is Hard. Journal of Computer and System Sciences, 81(8):1556--1574, 2015. [ bib ]
[178] Guillaume Fertin, Loïc Jankowiak, and Géraldine Jean. Prefix and Suffix Reversals on Strings. In C. Iliopoulos, S. Puglisi, and E. Yilmaz, editors, String Processing and Information Retrieval, volume 9309 of Lecture Notes in Computer Science, pages 165--176. Springer International Publishing, Switzerland, 2015. [ bib ]
[179] Bhadrachalam Chitturi. Tighter Upper Bound for Sorting Permutations with Prefix Transpositions. Theoretical Computer Science, 602:22--31, 2015. [ bib ]
[180] Irena Rusu. Log-Lists and Their Applications to Sorting by Transpositions, Reversals and Block-Interchanges. http://arxiv.org/abs/1507.01512, 2015. [ bib ]
[181] Laurent Bulteau, Guillaume Fertin, and Christian Komusiewicz. (Prefix) Reversal Distance for (Signed) Strings with Few Blocks or Small Alphabets. Journal of Discrete Algorithms, 37:44--55, 2016. [ bib ]
[182] Carla Negri Lintzmayer. The Problem of Sorting Permutations by Prefix and Suffix Rearrangements. PhD thesis, University of Campinas, Institute of Computing, 2016. In English. [ bib ]
[183] Carla Negri Lintzmayer, Guillaume Fertin, and Zanoni Dias. Sorting Permutations by Prefix and Suffix Rearrangements. Journal of Bioinformatics and Computational Biology, 15(1):1750002, 2017. [ bib ]

This file was generated by bibtex2html 1.98.