Abstract
Genomic maps often do not specify the order within some groups of two or more markers. The synthesis of a master map from several sources introduces additional order ambiguity due to markers missing from some sources. We represent each chromosome as a partial order, summarized by a directed acyclic graph (DAG), to account for poor resolution and missing data. The genome rearrangement problem is then to infer a minimum number of translocations and reversals for transforming a set of linearizations, one for each chromosomal DAG in the genome of one species, to linearizations of the DAGs of another species. We augment each DAG to a directed graph (DG) in which all possible linearizations are embedded. The chromosomal DGs representing two genomes are combined to produce a single bicoloured graph. From this we extract a maximal decomposition into alternating coloured cycles, determining an optimal sequence of rearrangements. We test this approach on simulated partially ordered genomes and on marker data from maize and sorghum chromosomal maps.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bader DA, Bernard ME, Moret BME, Yan M (2001) A linear-time algorithm for computing inversion distance between signed permutations with an experimental study, Journal of Computational Biology 8:483–491
Bowers JE, Abbey C, Anderson S, Chang C, Draye X, Hoppe AH, Jessup R, Lemke C, Lennington J, Li Z, Lin YR, Liu SC, Luo L, Marler BS, Ming R, Mitchell SE, Qiang D, Reischmann K, Schulze SR, Skinner DN, Wang YW, Kresovich S, Schertz KF, Paterson AH (2003) A high-density genetic recombination map of sequence-tagged sites for sorghum, as a framework for comparative structural and evolutionary genomics of tropical grains and grasses, Genetics 165:367–386
Hannenhalli S, Pevzner PA (1995) Transforming men into mice (polynomial algorithm for genomic distance problem). Proceedings of the IEEE 36th Annual Symposium on Foundations of Computer Sciencepp. 581–592
Hannenhalli S, Pevzner PA (1999) Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). Journal of the ACM 48:1–27
Menz MA, Klein RR, Mullet JE, Obert JA, Unruh NC, Klein PE (2002) A high-density genetic map of Sorghum bicolor (L.) Moench based on 2926 AFLP, RFLP and SSR markers. Plant Molecular Biology 48:483–499
Polacco ML, Coe E Jr (2002) IBM Neighbors: A Consensus Genetic Map. (http://www.maizegdb.org/ancillary/IBMneighbors.html)
Sankoff D, Zheng C, Lenert A (2005) Reversals of fortune. Proceedings of the RECOMB 2005 Workshop on Comparative Genomics (A. McLysaght and D. Huson, eds.) Lecture Notes in Bioinformatics 3678, Springer, pp. 131–141
Tesler G (2002) Efficient algorithms for multichromosomal genome rearrangements. Journal of Computer and System Sciences 65:587–609
Ware D, Jaiswal P, Ni J, Pan X, Chang K, Clark K, Teytelman L, Schmidt S, Zhao W, Cartinhour S, McCouch S, Stein L (2002) Gramene: a resource for comparative grass genomics. Nucleic Acids Research 30:103–105
Yancopoulos S, Attie O, Friedberg R (2005) Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21:3340–3346
Zheng C, Lenert A, Sankoff D (2005) Reversal distance for partially ordered genomes. Bioinformatics 21:i502–i508.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zheng, C., Sankoff, D. Genome rearrangements with partially ordered chromosomes. J Comb Optim 11, 133–144 (2006). https://doi.org/10.1007/s10878-006-7120-2
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10878-006-7120-2