Rearrangement and inference of chromosome structures
- 51 Downloads
The chromosome structure is defined as a set of chromosomes that consist of genes assigned to one of the DNA strands and represented in a circular or linear arrangement. A widely investigated problem is to define the shortest algorithmic path of chromosome rearrangements that transforms one chromosome structure into another. When equal rearrangement costs and constant gene content are considered, the solution to the problem is known. In this work, a principally novel approach was developed that presents an exact algorithm with linear time complexity for both equal and unequal costs, in which chromosome structures defined on the same set of genes were considered. In addition, to solve the problem of the inference of ancestral chromosome structures containing different sets of genes when the original structures are fixed in leaves, exact and heuristic algorithms were developed.
Keywordschromosome structure chromosome rearrangement effective exact algorithm ancestral structure species tree evolution along a species tree parsimony
Unable to display preview. Download preview PDF.
- 2.Romanov M.N., Farré-Belmonte M., Lithgow P.E., O’Connor B., Fowler K.E., Larkin D.M., Griffin D.K. 2014. In silico reconstruction of chromosomal rearrangements and an avian ancestral karyotype. In: XXII International Plant and Animal Genome Conference, January 11–16, 2014, San Diego, CA, USA.Google Scholar
- 3.Romanov M.N, Farré M., Lithgow P.E., Fowler K.E., Skinner B.M., O’Connor R., Fonseka G., Backström N., Matsuda Y., Nishida C., Houde P., Jarvis E.D., Ellegren H., Burt D.W., Larkin D.M., Griffin D.K. 2014. Reconstruction of gross avian genome structure, organization and evolution suggests that the chicken lineage most closely resembles the dinosaur avian ancestor. BMC Genomics. 15, 1060. doi 10.1186/1471-2164-15-1060PubMedCentralPubMedCrossRefGoogle Scholar
- 4.Bergeron A., Mixtacki J., Stoye J. 2006. A unifying view of genome rearrangements. Algorithms Bioinform. LNCS. 4175, 163–173.Google Scholar
- 6.Models and Algorithms for Genome Evolution. 2013. Eds. Chauve C., El-Mabrouk N., Tannier E. Comput. Biol. Series. London: Springer.Google Scholar
- 7.Lyubetsky V.A., Gorbunov K.Yu. 2013. Problems and algorithms related to chromosomal rearrangements. In: Sbornik izbrannykh trudov VIII Mezhdunarodnoi nauchnoprakticheskoi konferentsii. MGU im. M.V. Lomonosova, 8–10 noyabrya 2013 g. (Proc. 8th Int. Sci.-Pract. Conf., Moscow State Univ., November 8–10, 2013), Moscow: INTUIT.RU, pp. 764–768.Google Scholar
- 8.Lyubetsky V.A., Gorbunov K.Yu. 2014. Chromosome structures reconstruction. In: Sbornik materialov 4-i Moskovskoi mezhdunarodnoi konferentsii “Molekulyarnaya filogenetika MolPhy-4”. MGU im. M.V. Lomonosova, 23–26 sentyabrya 2014 g.) (Proc. 4th Moscow Int. Conf. on Molecular Phylogenetics, MolPhy-4, Moscow State Univ., September 23–36, 2014). Moscow: Torus Press, p. 42.Google Scholar
- 11.Rusin L.Y., Lyubetskaya E.V., Gorbunov K.Yu., Lyubetsky V.A. 2014. Reconciliation of gene and species trees. Biomed. Res. Int. 642089. doi 10.1155/2014/642089Google Scholar