Genome rearrangements with partially ordered chromosomes

Journal of Combinatorial Optimization

Volumn 11, Issue 2, 2006, Pages 133-144

  Zheng, Chunfang ^a   Sankoff, David ^b  

^a Department of Biology ^*  (Canada)

^b UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED ACYCLIC GRAPH (DAG); GENOMIC MAPS; SORGHUM CHROMOSOMAL MAPS;

COMPUTATIONAL GEOMETRY; COMPUTER SIMULATION; DATA ACQUISITION; EMBEDDED SYSTEMS; GRAPH THEORY; SET THEORY;

GENES;

EID: 33646508755     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-006-7120-2     Document Type: Conference Paper

References (11)

1. 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
2. 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
3. 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 Science pp. 581-592
4. Hannenhalli S, Pevzner PA (1999) Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). Journal of the ACM 48:1-27
5. 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
6. Polacco ML, Coe E Jr (2002) IBM Neighbors: A Consensus Genetic Map. (http://www.maizegdb.org/ancillary/IBMneighbors.html)
7. 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
8. Tesler G (2002) Efficient algorithms for multichromosomal genome rearrangements. Journal of Computer and System Sciences 65:587-609
9. 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
10. Yancopoulos S, Attie O, Friedberg R (2005) Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21:3340-3346
11. Zheng C, Lenert A, Sankoff D (2005) Reversal distance for partially ordered genomes. Bioinformatics 21:i502-1508.