The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - July-Aug. (2013 vol.10)
pp: 819-831
Pedro Feijao , Inst. of Comput., Univ. of Campinas, Campinas, Brazil
Joao Meidanis , Inst. of Comput., Univ. of Campinas, Campinas, Brazil
ABSTRACT
Algebraic rearrangement theory, as introduced by Meidanis and Dias, focuses on representing the order in which genes appear in chromosomes, and applies to circular chromosomes only. By shifting our attention to genome adjacencies, we introduce the adjacency algebraic theory, extending the original algebraic theory to linear chromosomes in a very natural way, also allowing the original algebraic distance formula to be used to the general multichromosomal case, with both linear and circular chromosomes. The resulting distance, which we call algebraic distance here, is very similar to, but not quite the same as, double-cut-and-join distance. We present linear time algorithms to compute it and to sort genomes. We show how to compute the rearrangement distance from the adjacency graph, for an easier comparison with other rearrangement distances. A thorough discussion on the relationship between the chromosomal and adjacency representation is also given, and we show how all classic rearrangement operations can be modeled using the algebraic theory.
INDEX TERMS
Bioinformatics, Genomics, Biological cells, Extremities, Sorting, IEEE transactions, Computational biology,combinatorial algorithms, Biology and genetics
CITATION
Pedro Feijao, Joao Meidanis, "Extending the Algebraic Formalism for Genome Rearrangements to Include Linear Chromosomes", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.10, no. 4, pp. 819-831, July-Aug. 2013, doi:10.1109/TCBB.2012.161
REFERENCES
[1] S. Yancopoulos, O. Attie, and R. Friedberg, "Efficient Sorting of Genomic Permutations by Translocation, Inversion and Block Interchange," Bioinformatics, vol. 21, no. 16, pp. 3340-3346, 2005.
[2] C.L. Lu, Y.L. Huang, T.C. Wang, and H.-T. Chiu, "Analysis of Circular Genome Rearrangement by Fusions, Fissions and Block-Interchanges," BMC Bioinformatics, vol. 7, article 295, 2006.
[3] C. Mira and J. Meidanis, "Sorting by Block-Interchanges and Signed Reversals," Proc. Fourth Int'l Conf. Information Technology (ITNG '07), pp. 670-676, 2007.
[4] Z. Dias and J. Meidanis, "Genome Rearrangements Distance by Fusion, Fission, and Transposition Is Easy," Proc. Eighth Int'l Symp. String Processing and Information Retrieval (SPIRE '01), pp. 250-253, 2001.
[5] J. Meidanis and Z. Dias, "An Alternative Algebraic Formalism for Genome Rearrangements," Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment and Evolution of Gene Families, pp. 213-223, Kluwer Academic Publishers, 2000.
[6] Y.-L. Huang and C.L. Lu, "Sorting by Reversals, Generalized Transpositions, and Translocations Using Permutation Groups," J. Computational Biology, vol. 17, no. 5, pp. 685-705, 2010.
[7] A. Bergeron, J. Mixtacki, and J. Stoye, "A Unifying View of Genome Rearrangements," Proc. Sixth Int'l Workshop Algorithms in Bioinformatics, pp. 163-173, 2006.
[8] P. Feijao and J. Meidanis, "SCJ: A Breakpoint-Like Distance That Simplifies Several Rearrangement Problems," IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 8, no. 5, pp. 1318-1329, Sept./Oct. 2011.
[9] M. Alekseyev and P. Pevzner, "Multi-Break Rearrangements and Chromosomal Evolution," Theoretical Computer Science, vol. 395, nos. 2/3, pp. 193-202, 2008.
[10] M.D.V. Braga and J. Stoye, "The Solution Space of Sorting by DCJ," J. Computational Biology, vol. 17, no. 9, pp. 1145-65, 2010.
115 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool