Sorting by block-interchanges and signed reversals

Proceedings - International Conference on Information Technology-New Generations, ITNG 2007

Volumn , Issue , 2007, Pages 670-674

  Mira, Cleber ^a   Meidanis, Joao ^b  

^a UNIVERSITY OF CAMPINAS   (Brazil)

^b SCYLLA BIOINFORMATICS   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GENES; INTERCHANGES; PARAMETER ESTIMATION; SORTING;

COMPARATIVE ANALYSIS; REARRANGEMENT MEASURE; UNICHROMOSOMAL GENOME;

SIGNAL ANALYSIS;

EID: 34548120880     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITNG.2007.184     Document Type: Conference Paper

References (19)

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. Journal of Computational Biology, 8(5):483-491, 2001.
2. A. Bergeron. A very elementary presentation of the Hannenhalli-Pevzner theory. Discrete Applied Mathematics, 146(2):134-135, 2005.
3. M. Blanchette, T. Kunisawa, and D. Sankoff. Parametric genome rearrangement. Journal of Computational Biology, 172:11-17, 1996.
4. D. A. Christie. Sorting permutations by block-interchanges. Information Processing Letters, 60(4):165-169, November 1996.
5. Z. Dias and J. Meidanis. Genome rearrangements distance by fusion, fission, and transposition is easy. In Proceedings of the String Processing and Information Retrieval (SPIRE'2001), pages 250-253, Laguna de San Rafael, Chile, November 2001. IEEE Computer Society.
6. I. Grossman and W. Magnus. Groups and Their Graphs. The Mathematical Association of America, 1992.
7. S. Hannenhalli and P. 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'95), pages 581-592, Los Alamitos, USA, Oct. 1995. IEEE Computer Society Press.
8. 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-27, Jan. 1999.
9. T. Hartman and R. Shamir. A simpler and faster 1.5-approximation algorithm for sorting by transpositions. In Proceedings of CPM'03, pages 156-169, 2003. extended version.
10. 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, Jan. 2000.
11. H. Kaplan and E. Verbin. Efficient data structures and a new randomized approach for sorting signed permutations by reversals. In Combinatorial Pattern Matching, 14th Annual Symposium, CPM 2003, Morelia, Michocán, Mexico, June 25-27, 2003, Proceedings, volume 2676 of Lecture Notes in Computer Science. Springer, 2003.
12. Y. C. Lin, C. L. Lu, , H. Chang, and C. Y. Tang. An efficient algorithm for sorting by block-interchanges and its application to the evolution of vibrio species. Journal of Computational Biology, 12:102-112, 2005.
13. S. MacLane and G. Birkhoff. Algebra. The Macmillan Company, London, sixth printing edition, 1971.
14. J. Meidanis and Z. 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, pages 213-223. Kluwer Academic Publishers, Nov. 2000.
15. 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, Dec. 2000.
16. 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.
17. J. D. Palmer, B. Osorio, and W. F. Thompson. Evolutionary significance of inversions in legume chloroplast DNAs. Current Genetics, 14:65-74, 1988.
18. E. Tannier and M.-F. Sagot. Sorting by reversals in sub-quadratic time. Technical Report 5097, INRIA, Institut National de Recherche en Informatique et en Automatique, January 2004.
19. S. Yancopoulos, O. Attie, and R. Friedberg. Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics, 21(16):3340-3346, June 2005.