Edit distances and factorisations of even permutations

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

Volumn 5193 LNCS, Issue , 2008, Pages 635-646

  Labarre, Anthony ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

FACTORIZATION; INTERCONNECTION NETWORKS (CIRCUIT SWITCHING);

CYCLE GRAPHS; EDIT DISTANCE; FUNDAMENTAL TOOLS; GENOME REARRANGEMENTS; LOWER BOUNDS; SORTING PERMUTATIONS; TRANSPOSITION DISTANCES;

GRAPH THEORY;

EID: 57749178369     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87744-8_53     Document Type: Conference Paper

References (17)

1. Li, Z., Wang, L., Zhang, K.: Algorithmic approaches for genome rearrangement: a review. IEEE Transactions on Systems, Man and Cybernetics, Part C 36(5), 636-648 (2006)
2. Kececioglu, J., Sankoff, D.: Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement, Algorithmica 13(1-2), 180-210 (1995)
3. Christie, D.A.: Sorting permutations by block-interchanges. Information Processing Letters 60(4), 165-169 (1996)
4. Bafna, V., Pevzner, P.A.: Sorting by transpositions. SIAM Journal on Discrete Mathematics 11(2), 224-240 (1998)
5. Caprara, A.: Sorting permutations by reversals and eulerian cycle decompositions. SIAM Journal on Discrete Mathematics 12(1), 91-110 (1999)
6. Elias, I., Hartman, T.: A 1.375-approximation algorithm for sorting by transpositions. IEEE/ACM Transactions on Computational Biology and Bioinformatics 3(4), 369-379 (2006)
7. Lakshmivarahan, S., Jwo, J.S., Dhall, S.K.: Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey. Parallel Computing 19(4), 361-407 (1993)
8. Akers, S.B., Krishnamurthy, B.: A group-theoretic model for symmetric interconnection networks. IEEE Transactions on Computers 38(4), 555-566 (1989)
9. Gates, W.H., Papadimitriou, C.H.: Bounds for sorting by prefix reversal. Discrete Mathematics 27(1), 47-57 (1979)
10. Akers, S.B., Krishnamurthy, B., Harel, D.: The star graph: An attractive alternative to the n-cube. In: Proceedings of the Fourth International Conference on Parallel Processing, August 1987, pp. 393-400. Pennsylvania State University Press (1987)
11. Dias, Z., Meidanis, J.: Sorting by prefix transpositions. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol. 2476, pp. 65-76. Springer, Heidelberg (2002)
12. Doignon, J.P., Labarre, A.: On Hultman numbers. Journal of Integer Sequences 10(6), Article 07.6.2, 13 pages (2007)
13. Chitturi, B., Sudborough, I.H.: Bounding prefix transposition distance for strings and permutations. In: Proceedings of the Forty-First Annual Hawaii International Conference on System Sciences, January 2008, p. 468. IEEE Computer Society Press, Los Alamitos (2008)
14. Wielandt, H.: Finite permutation groups. Translated from German by R. Bercov. Academic Press, New York (1964)
15. Labarre, A.: New bounds and tractable instances for the transposition distance. IEEE/ACM Transactions on Computational Biology and Bioinformatics 3(4), 380-394 (2006)
16. Jerrum, M.R.: The complexity of finding minimum-length generator sequences. Theoretical Computer Science 36(2-3), 265-289 (1985)
17. Fortuna, V.J.: Distâncias de transposição entre genomas. Master's thesis, Universidade Estadual de Campinas, São Paulo, Brazil (March 2005)