Sorting by prefix transpositions

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

Volumn 2476, Issue , 2002, Pages 65-76

  Dias, Zanoni ^a   Meidanis, João ^a  

^a UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION RETRIEVAL;

BREAKPOINT; COMPUTATIONAL TESTS; GENOME REARRANGEMENTS; LOWER BOUNDS; PERFORMANCE RATIO; SORTING PERMUTATIONS; TRANSPOSITION DISTANCES;

APPROXIMATION ALGORITHMS;

EID: 84958776999     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45735-6_7     Document Type: Conference Paper

References (20)

1. M. Aigner and D.B. West. Sorting by insertion of leading element. Journal of Combinatorial Theory, 45:306–309, 1987.
2. 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. Journal of Computational Biology, 8(5):483–491, 2001.
3. V. Bafna and P.A. Pevzner. Genome rearrangements and sorting by reversals. SIAM Journal on Computing, 25(2):272–289, 1996.
4. V. Bafna and P.A. Pevzner. Sorting by transpositions. SIAM Journal on Discrete Mathematics, 11(2):224–240, May 1998.
5. A. Caprara. Sorting by reversals is difficult. In Proceedings of the First International Conference on Computational Molecular Biology - (RECOMB’97), pages 75–83, New York, USA, January 1997. ACM Press.
6. D.A. Christie. A 3/2-approximation algorithm for sorting by reversals. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 244–252, San Francisco, USA, January 1998.
7. D.A. Christie. Genome Rearrangement Problems. PhD thesis, Glasgow University, 1998.
8. H. Dweighter. American Mathematical Monthly, volume 82, page 1010. The Mathematical Association of America, 1975.
9. W.H. Gates and C.H. Papadimitriou. Bounds for sorting by prefix reversals. Discrete Mathematics, 27:47–57, 1979.
10. S. Hannenhalli and P.A. Pevzner.: Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals. Journal of the ACM, 46(1):1–7, January 1999.
11. M. H. Heydari and I. H. Sudborough. Sorting by prefix reversals is np-complete. To be submitted.
12. M. H. Heydari and I. H. Sudborough. On the diameter of the pancake network. Journal of Algorithms, 25:67–94, 1997.
13. R.W. Irving and D.A. Christie. Sorting by reversals: on a conjecture of kececioglu and sankoff. Technical Report TR-95-12, Department of Computing Science, University of Glasgow, May 1995.
14. H. Kaplan, R. Shamir, and R.E. Tarjan. Faster and simpler algorithm for sorting signed permutations by reversals. SIAM Journal on Computing, 29(3):880–892, January 2000.
15. J.D. Kececioglu and D. Sankoff. Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement. Algorithmica, 13:180–210, January 1995.
16. J. Meidanis, M.E. Walter, and Z. 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’97), pages 70–79, Valparaiso, Chile, 1997. Carleton University Press.
17. J. Meidanis, M. E.M.T. Walter, and Z. Dias. Reversal distance of signed circular chromosomes. Technical Report IC-00-23, Institute of Computing - University of Campinas, December 2000.
18. J.D. Palmer and L.A. Herbon. Plant mitochondrial dna evolves rapidly in structure, but slowly in sequence. Journal of Molecular Evolution, 27:87–97, 1988.
19. J.C. Setubal and J. Meidanis. Introduction to Computional Molecular Biology. PWS Publishing Company, 1997.
20. N.Q. Tran. An easy case of sorting by reversals. In A. Apostolico and J. Hein, editors, Proceedings of the 8th Annual Symposium of the Combinatorial Pattern Matching (CPM’97), volume 1264 of Lecture Notes in Computer Science, pages 83–89, Aarhus, Denmark, June 1997. Springer.