Genome rearrangement with gene families

Bioinformatics

Volumn 15, Issue 11, 1999, Pages 909-917

  Sankoff, David ^a  

^a Center de Recherches Mathematiques   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; COMPUTER ANALYSIS; CONFERENCE PAPER; GENE REARRANGEMENT; GENETIC ANALYSIS; GENOME; MULTIGENE FAMILY; PRIORITY JOURNAL;

EID: 0033391532     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/15.11.909     Document Type: Conference Paper

References (25)

1. Altenberg, L. (1995) Genome growth and the evolution of the genotype-phenotype map. In Banzhaf, W. and Eeckman, F.H. (eds). Evolution and Biocomputation: Computational Models of Evolution. Lecture Notes in Computer Science 899. Springer, New York, pp. 205-259.
2. Berman, P. and Hannenhalli, S. (1996) Fast sorting by reversal. In Hirschberg, D. and Myers, G. (eds). Combinatorial Pattern Matching. 7th Annual Symposium. Lecture Notes in Computer Science 1075. Springer, New York, pp. 168-185.
3. Caprara, A. (1997) Sorting by reversals is difficult. In Proceedings of the First Annual International Conference on Computational Molecular Biology (RECOMB 97) ACM, New York, pp. 75-83.
4. Caprara, A. (1999) Formulations and hardness of multiple sorting by reversals. In Istrail, S., Pevzner, P. and Waterman, M. (eds). Proceedings of the Third Annual International Conference on Computational Molecular Biology (RECOMB 99) ACM, New York, pp. 84-93.
5. Christie, D.A. (1998) Sorting strings by global transformations. Chapter 5 of Genome Rearrangement Problems. PhD dissertation, Department of Computing Science, University of Glasgow.
6. DasGupta, B., Jiang, T., Kannan, S., Li, M. and Sweedyk, Z. (1997) On the complexity and approximation of syntenic distance. In Proceedings of the First Annual International Conference on Computational Molecular Biology (RECOMB 97) ACM, New York, pp. 99-108.
7. El-Mabrouk, N. and Sankoff, D. (1999) Hybridization and genome rearrangement. In Crochemore, M. and Paterson, M. (eds). Combinatorial Pattern Matching. 10th Annual Symposium. Lecture Notes in Computer Science 1645. Springer, New York, pp. 78-87.
8. Ferretti, V., Nadeau, J.H. and Sankoff, D. (1996) Original synteny. In Hirschberg, D. and Myers, G. (eds). Combinatorial Pattern Matching. 7th Annual Symposium. Lecture Notes in Computer Science 1075. Springer, New York, pp. 159-167.
9. Hannenhalli, S. (1995) Program for computing an optimal sorting by reversal for signed permutations.http://www-hto.usc.edu/ software/distance/signed_dist.c.
10. Hannenhalli, S. and Pevzner, P.A. (1995a) Transforming cabbage into turnip. (polynomial algorithm for sorting signed permutations by reversals). In Proceedings of the 27th Annual ACM-SIAM Symposium on the Theory of Computing pp. 178-189.
11. Hannenhalli, S. and Pevzner, P.A. (1995b) Transforming men into mice (polynomial algorithm for genomic distance problem). In Proceedings of the IEEE 36th Annual Symposium on Foundations of Computer Science pp. 581-592.
12. Kaplan, H., Shamir, R. and Tarjan, R.E. (1997) Faster and simpler algorithm for sorting signed permutations by reversals. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms ACM, New York, pp. 344-351.
13. Kececioglu, J. and Sankoff, D. (1994) Efficient bounds for oriented chromosome inversion distance. In Crochemore, M. and Gusfield, D. (eds). Combinatorial Pattern Matching. 5th Annual Symposium. Lecture Notes in Computer Science 807. Springer, New York, pp. 307-325.
14. Liben-Nowell, D. (1999) On the structure of syntenic distance. In Crochemore, M. and Paterson, M. (eds). Combinatorial Pattern Matching. 10th Annual Symposium. Lecture Notes in Computer Science 1645. Springer, New York, pp. 50-65.
15. Nadeau, J.H. and Sankoff, D. (1997) Comparable rates of gene loss and functional divergence after genome duplications early in vertebrate evolution. Genetics, 147, 1259-1266.
16. Nadeau, J.H. and Sankoff, D. (1998) Counting on comparative maps. Trends Genet., 14, 495-501.
17. Page, R. and Charleston, M.A. (1997) From gene to organismal phylogeny: reconciled trees and the gene tree/species tree problem. Mol. Phylogenet. Evol., 7, 231-240.
18. Sankoff, D. (1989) Mechanisms of genome evolution: models and inference. Bull. Int. Stat. Instit., 47, 461-475.
19. Sankoff, D. and Blanchette, M. (1997) The median problem for breakpoints in comparative genomics. In Jiang, T. and Lee, D.T. (eds). Computing and Combinatorics, Proceedings of COCOON '97. Lecture Notes in Computer Science 1276. Springer, New York, pp. 251-263.
20. Sankoff, D. and Blanchette, M. (1998) Multiple genome rearrangement and breakpoint phylogeny. J. Computat. Biol., 5, 555-570.
21. Sankoff, D., Sundaram, G. and Kececioglu, J. (1996) Steiner points in the space of genome rearrangements. Int. J. Foundations Comput. Sci., 7, 1-9.
22. Slonimski, P.P., Mossé, M.-O., Golik, P., Hénault, A., Diaz, Y., Risler, J-.L., Comet, J.-P., Aude, J.-C., Wozniak, A., Glémet, E. and Codani, J.-J. (1998) The first laws of genomics. Microb. Comp. Genomics, 3, 46.
23. Varré, J.-S., Delahaye, J.-P. and Rivals, É. (1999) Transformation distances: a family of dissimilarity measures based on movements of segments. Bioinformatics, 15, 194-202.
24. Watterson, G.A., Ewens, W.J., Hall, T.E. and Morgan, A. (1982) The chromosome inversion problem. J. Theor. Biol., 99, 1-7.
25. Wolfe, K.H. and Shields, D.C. (1997) Molecular evidence for an ancient duplication of the entire yeast genome. Nature, 387, 708-713.