Reversals of fortune

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3678 LNBI, Issue , 2005, Pages 131-141

  Sankof, David ^a   Zheng, Chungfang ^a   Lenert, Aleksander ^a  

^a UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONFORMAL MAPPING; GENES; HEURISTIC METHODS; LINEARIZATION; PROBLEM SOLVING;

CEREAL GENOMES; GENETIC MAPS; GENOME-LEVEL PROBLEMS; ORTHOLOG IDENTIFICATION;

GENETIC ENGINEERING;

EID: 33646158213     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (39)

1. Blin, G. and Rizzi, R. 2005. Conserved interval distance computation between non-trivial genomes. In Wang, L. (ed), Proceedings of COCOON '05. LNCS 3595. Berlin, Heidelberg:Springer Verlag, in press.
2. Bourque, G., Pevzner, P.A. and Tesler, G. 2004. Reconstructing the genomic architecture of ancestral mammals: lessons from human, mouse, and rat genomes. Genome Research, 14:507-516.
3. Bourque, G., Yacef, Y., and El-Mabrouk, N. 2005. Maximizing synteny blocks to identify ancestral homologs. manuscript.
4. Bourque, G., Zdobnov, E., Bork, P., Pevzner, P. and Tesler, G. 2005. Comparative architectures of mammalian and chicken genomes reveal highly variable rates of genomic rearrangements across different lineages. Genome Research, 15:98-110.
5. Bowers, J. E., Abbey, C., Anderson, S., Chang, C., Draye, X., Hoppe, A. H., Jessup, R., Lemke, C., Lennington, J., Li, Z., Lin, Y. R., Liu, S. C., Luo, L., Marler, B. S., Ming, R., Mitchell, S.E., Qiang, D., Reischmann, K., Schulze, S. R., Skinner, D. N., Wang, Y. W., Kresovich, S., Schertz, K. F., Paterson, A. H. 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-86.
6. Bryant, D. 2000. The complexity of calculating exemplar distances. In Sankoff, D. and Nadeau, J. (eds), Comparative Genomics. Dordrecht, NL: Kluwer, pp. 207-212.
7. Caprara, A. 1997. Sorting by reversals is difficult, in Istrail, S., Pevzner, P.A. and Waterman, M.S. (eds.) Proceedings of the First Annual International Conference on Computational Molecular Biology (RECOMB'97), ACM Press, pp. 75-83.
8. Caprara, A., Lancia, G. and Ng, S.K. 2001. Sorting permutations by reversals through branch-and-price. INFORMS Journal on Computing 13, 224-244.
9. Chen, X., Zheng, J., Fu, Z., Nan, P., Zhong, Y., Lonardi, S. and Jiang, T. 2005. Assignment of orthologous genes via genome rearrangement. IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), in press.
10. Christie, D. A. 1996. Sorting permutations by block interchanges. Information Processing Letters 60:165-169.
11. Friedberg, R., Attie, O. and Yancopoulos, S. 2005. Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics, in press
12. l-Mabrouk, N. and Sankoff, D. 2003. The reconstruction of doubled genomes. SIAM Journal on Computing 32:754-792.
13. Gaut, B. S. and Doebley, J.F. 1997. DNA sequence evidence for the segmental allotetraploid origin of maize. Proc. Natl. Acad. Sci. USA. 94:6809-6814.
14. Hannenhalli, S. and Pevzner, P.A. 1995. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). In Proc. 27th Annual ACM Symposium on the Theory of Computing, pp. 178-189.
15. Hannenhalli, S. and Pevzner, P.A. 1995. Transforming men into mice (polynomial algorithm for genomic distance problem. Proceedings of the IEEE 36th Annual Symposium on Foundations of Computer Science. 581-92.
16. Hannenhalli, S. and Pevzner, P.A. 1996. To cut or not to cut (applications of comparative physical maps in molecular evolution). In Proceedings of the 7th annual ACM-SIAM symposium on discrete algorithms, Philadelphia: SIAM, pp. 304-313.
17. Kececioglu, J. and Sankoff, D. 1993. Exact and approximation algorithms for the inversion distance between two permutations. In Proceedings of 4th Combinatorial Pattern Matching symposium, LNCS 684, Springer Verlag, pp. 87-105.
18. (Cf. Algorithmica 13: 180-210, 1995.).
19. Menz, M. A., Klein, R. R., Mullet, J. E., Obert, J. A., Unruh, N.C., and Klein, P. E. 2002. A high-density genetic map of Sorghum bicolor (L.) Moench based on 2926 AFLP, RFLP and SSR markers. Plant Molecular Biology 48:483-99.
20. Morgan, T. H., Sturtevant, A. H., Muller, H. J., and Bridges, C.B. 1915. The mechanism of Mendelian heredity. New York: Henry Holt, and Co.
21. NCBI Human Mouse Homology.http://www.ncbi.nlm.nih.gov/Homology/
22. Nicholas, F.W., Barendse, W., Collins, A., Darymple, B.P., Edwards, J.H., Gregory, S., Hobbs, M., Khatkar, M.S., Liao, W., Maddox, J.F., Raadsma, H.W. and Zenger K. R. 2004. Integrated maps and Oxford grids: maximising the power of comparative mapping. Poster at International Society of Animal Genetics.
23. Nguyen, C.T., Tay, Y.C. and Zhang, L. 2005. Divide-and-conquer approach for the exemplar breakpoint distance. Bioinformatics, in press.
24. Palmer, J.D., Osorio, B. and Thompson, W.F. 1988. Evolutionary significance of inversions in legume chloroplast DNAs. Current Genetics 14:6574.
25. Pevzner, P.A. and Tesler, G. 2003. Human and mouse genomic sequences reveal extensive breakpoint reuse in mammalian evolution. Proc Natl Acad Sci USA 100:7672-7
26. Polacco, M.L.; Coe, E., Jr. 2002. IBM Neighbors: A Consensus Genetic Map. (http://www.maizegdb.org/ancillary/IBMneighbors.html)
27. Radcliffe, A.J., Scott, A.D. and Wilmer, R.E. 2005. Reversals and transpositions over finite alphabets. SIAM Journal on Discrete Math, in press.
28. Sankoff, D. 1999. Genome rearrangement with gene families. Bioinformatics, 15:909-917.
29. Sankoff, D. and El-Mabrouk, N. 2000. Duplication, rearrangement and reconciliation. In Sankoff, D. and Nadeau, J. H., (eds) Comparative Genomics. Dordrecht, NL: Kluwer.
30. Sankoff, D., Leduc, G., Antoine, N., Paquin, B. Lang, B.F. and Cedergren, R. 1992. Gene order comparisons for phylogenetic inference: Evolution of the mitochondrial genome. Proc. Natl. Acad. Sci. USA, 89:6575-6579.
31. Sturtevant, A. H. 1913 The linear arrangement of six sex-linked factors in Drosophila, as shown by their mode of association. Jour. Exp. Zool. 14: 43-59.
32. Sturtevant, A. H. 1921. Genetic studies on Drosophila simulans. II. Sex-linked group of genes. Genetics 6: 43-64.
33. Tang, J. and Moret, B.M.E. 2003. Phylogenetic reconstruction from gene rearrangement data with unequal gene contents. In WADS '03. LNCS 2748, Springer Verlag, pp. 37-46.
34. Tesler, G. 2002 GRIMM: genome rearrangements web server. Bioinformatics, 18, 492-3.
35. Tesler, G. 2002. Efficient algorithms for multichromosomal genome rearrangements. Journal of Computer and System Sciences 65:587-609.
36. UCSC Genome Browser
37. Ware, D., Jaiswal, P., Ni, J., Pan, X., Chang, K., Clark, K., Teytelman, L., Schmidt, S., Zhao, W., Cartinhour, S., McCouch, S. and Stein, L. 2002. Gramene: a resource for comparative grass genomics. Nucleic Acids Research 30, 103-5.
38. Zheng, C., Lenert, A. and Sankoff, D. 2005. Reversal distance for partially ordered genomes. Bioinformatics 21, in press
39. Zheng, C. and Sankoff, D. 2005. Genome rearrangements with partially ordered Chromosomes. In Wang, L. (ed), Proceedings of COCOON '05. LNCS 3595. Berlin, Heidelberg:Springer Verlag, in press.