Improving the algorithm of Bafna and Pevzner for the problem of sorting by transpositions: A practical approach

Journal of Discrete Algorithms

Volumn 3, Issue 2-4, 2005, Pages 342-361

  Walter, Maria Emilia M T ^a   Sobrinho, Mauro C ^a   Oliveira, Eugenia T G ^a   Soares, Lorena S ^a   Oliveira, Adilton G ^a   Martins, Thelmo E S ^a   Fonseca, Tiago M ^a  

^a UNIVERSITY OF BRASILIA   (Brazil)

Author keywords

Algorithm of Bafna and Pevzner; Cycle graph; Time complexity; Transposition

Indexed keywords

COMPUTER SCIENCE; COMPUTER SYSTEMS PROGRAMMING; DATA STRUCTURES; GENES; GENETIC ENGINEERING; HEURISTIC PROGRAMMING; INFORMATION RETRIEVAL; PROBLEM SOLVING;

ALGORITHM OF BAFNA AND PEVZNER; CYCLE GRAPH; TIME COMPLEXITY; TRANSPOSITION;

ALGORITHMS;

EID: 18544389831     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2004.08.012     Document Type: Conference Paper

References (16)

1. D.A. Bader, B.M.E. Moret, and M. Yan A linear-time algorithm for computing inversion distance between signed permutations with an experimental study J. Comput. Biol. 8 5 2001 483 491
2. V. Bafna, and P. Pevzner Sorting by transpositions SIAM J. 11 2 1998 224 240
3. D.A. Christie, Genome rearrangements problems, PhD Thesis, Glasgow University, Scotland, 1998
4. Z. Bias, and J. Meidanis Sorting by prefix transpositions SPIRE'2002 - String Processing and Information Retrieval 2002 65 76
5. S.A. Guyer, L.S. Heath, and J.P.C. Vergara Subsequences and run heuristics for sorting by transpositions 4th Dimacs International Algorithm Implementation 1995 Challenge
6. T. Hartman A simpler 1.5-approximation algorithm for sorting by transpositions 14th Annual Symposium, CPM 2003, Morelia, Michoacan, Mexico 2003 156 169
7. 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, 2004
8. R.W. Irving, and D.A. Christie Sorting permutations by block interchanges Inform. Process. Lett. 60 1996 165 169
9. T.E.S. Martins, and T.M. Fonseca Studies in computational biology: Genome rearrangements and sequence comparison Monography of Undergraduate Course July 2003 Department of Computer Science, University of Brasilia
10. J. Meidanis, M.E.M.T. Walter, and Z. Dias Transposition distance between a permutation and its reverse R. Baeza Yates Anais do IV South American Workshop on String Processing - WSP'97 1997 Carleton University Press Valparaiso, Chile 70 79
11. E.T.G. Oliveira, Implementations of algorithms for the problem of sorting by transpositions, Master's Thesis, Department of Computer Science, University of Brasilia, 2001
12. J.P. Vergara, Sorting by bounded permutations, PhD Thesis, Virginia Polytechnic Institute and State University, 1997
13. M.E.M.T. Walter, L.R.A.F. Curado, and A.G. Oliveira Working on the problem of sorting by transpositions on genome rearrangements 14th Annual Symposium, CPM 2003, Morelia, Michoacan, Mexico 2003 372
14. M.E.M.T. Walter, and E.T.G. de Oliveira Extending the theory of Bafna and Pevzner for the problem of sorting by transpositions TEMA-Seleta do XXIV 2002 CNMAC
15. M.E.M.T. Walter, and E.T.G. de Oliveira The problem of sorting by trans positions and the algorithm of Bafna and Pevzner SEMISH - XXII Seminario Integrado de Software e Hardware, Florianpolis, Brazil 2002
16. M.E.M.T. Walter, Z. Dias, and J. Meidanis A new approach for approximating the transposition distance Proc. String Processing and Information Retrieval - SPIRE'2000 2000 199 208