Sorting circular permutations by bounded transpositions

Advances in Experimental Medicine and Biology

Volumn 680, Issue , 2010, Pages 725-736

  Feng, Xuerong ^b   Chitturi, Bhadrachalam ^a   Sudborough, Hal ^b  

^a UNIVERSITY OF TEXAS AT DALLAS   (United States)

^b NONE

Author keywords

Bounds; Genomic mutations; Sorting; Transpositions

Indexed keywords

ALGORITHM; BACTERIAL GENE; CHROMOSOME INVERSION; CONFERENCE PAPER; GENE REARRANGEMENT; KAPPA BOUNDED TRANSPOSITION; MATHEMATICAL PARAMETERS; PRIORITY JOURNAL; VIRUS GENE; ANIMAL; ARTICLE; BIOLOGICAL MODEL; BIOLOGY; COMPUTER SIMULATION; GENE ORDER; HUMAN; MOLECULAR EVOLUTION;

ALGORITHMS; ANIMALS; COMPUTATIONAL BIOLOGY; COMPUTER SIMULATION; EVOLUTION, MOLECULAR; GENE ORDER; GENE REARRANGEMENT; HUMANS; MODELS, GENETIC;

EID: 79952199575     PISSN: 00652598     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-1-4419-5913-3_81     Document Type: Conference Paper

References (11)

1. Pevzner, P.A. and Tesler, G. Genome rearrangements in mammalian evolution: Lessons from human and mouse genomes. Genomes (2003) 13(1):37-15
2. Chitturi, B., Sudborough, I.H., Voit, W., and Feng, X. Adjacent Swaps on Strings, LNCS 5092. Springer, Berlin, pp. 299-308, 2008
3. Heath, L.S. and Vergara, J.C. Sorting by short swaps. Journal of Computational Biology (2003) 10(4):75-89
4. Feng, X., Sudborough, I.H., and Lu, E. A fast algorithm for sorting by short swap. Proceeding of the 10th IASTED International Conference on Computational and Systems Biology, pp. 62-67, 2006
5. Jerrum, M. The complexity of finding minimum-length generator sequences. Theoretical Computer Science (1985) 36:265-289 (Pubitemid 15547194)
6. Pevzner, P.A. Computational Molecular Biology: An Algorithmic Approach. MIT, Cambridge, 2000
7. Mahajan, M., Rama, R., and Vijayakumar, S. On sorting by 3-bounded transpositions. Discrete Mathematics (2006) 306(14):1569-1585 (Pubitemid 43974761)
8. Bruijn, N.G. Sorting by means of swapping. Discrete Mathematics (1974) 9:333-339
9. Hartman, T. and Shamir, R. A simpler 1.5-approximation algorithm for sorting by transpositions. Proceedings of the 14th Symposium on Combinatorial Pattern Matching (CPM), LNCS 2089. Springer, Berlin, pp. 156-169, 2003
10. Walter, M.E., Dias, Z., and Meidanis, J. Reversal and transposition distance of linear chromosomes. Proceedings of SPIRE'98 - String Processing and Information Retrieval: A South American Symposium, pp. 96-102, 1998
11. Solomon, A., Sutcliffe, P., and Lister, R. Sorting circular permutations by reversal. Proceedings of the Workshop on Algorithms and Data Structures, Carleton University, Ottawa, Canada, LNCS 2748, Springer, Berlin, pp. 319-328, 2003