Models and Methods in Comparative Genomics

Advances in Computers

Volumn 68, Issue , 2006, Pages 59-104

  Bourque, Guillaume ^a   Zhang, Louxin ^b  

^a GENOME INSTITUTE OF SINGAPORE   (Singapore)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33751116835     PISSN: 00652458     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0065-2458(06)68002-9     Document Type: Review

References (171)

1. Addario-Berry L., Hallett M., Lagergren J., "Towards identifying lateral gene transfer events", in: Proc. of Pacific Symp. Biocomput., 2003, pp. 279-290
2. Aravind L. Guilt by association: contextual information in genome analysis. Genome Res. 10 8 (2000) 1074-1077
3. Arvestad L., Berglund A.C., Lagergren J., and Sennblad B. Bayesian gene/species tree reconciliation and orthology analysis using MCMC. Bioinformatics 19 Suppl. 1 (2003) i7-i15
4. Bader D.A., Moret B.M.E., Yan M., "A linear-time algorithm for computing inversion distance between signed permutations with an experimental study", in: Proceedings of the 7th Internat. Workshop on Algorithms and Data Structures, WADS '01, 2001, pp. 365-376
5. Bandelt H.J., and Dress A. A canonical decomposition theory for metrics on a finite set. Adv. Math. 92 (1992) 47-105
6. Bandelt H.J., Forster P., Sykes B.C., and Richards M.B. Mitochondrial portraits of human populations using median networks. Genetics 141 2 (1995) 743-753
7. Bandelt H.J., Forster P., and Rohl A. Median-joining networks for inferring intraspecific phylogenies. Mol. Biol. Evol. 16 1 (1999) 37-48
8. Batzoglou S. The many faces of sequence alignment. Brief Bioinform. 6 1 (2005) 6-22
9. Benson G., Dong L., "Reconstructing the duplication history of a tandem repeat", in: Proc. Internat. Conf. Intell. Syst. Mol. Biol. 1999, pp. 44-53
10. Bergeron A., Stoye J., "On the similarity of sets of permutations and its applications to genome comparison", in: Proceeding COCOON, 2003, pp. 68-79
11. Bergeron A., Mixtacki J., Stoye J., "Reversal distance without hurdles and fortresses", in: Proceedings CPM, 2004, pp. 388-399
12. Bergeron A., Blanchette M., Chateau A., Chauve C., "Reconstructing ancestral gene orders using conserved intervals", in: Proceedings of WABI, 2004, pp. 14-25
13. Bafna V., and Pevzner P.A. Sorting by transpositions. SIAM J. Discrete Math. 11 2 (1998) 224-240
14. Bafna V., and Pevzner P.A. Genome rearrangements and sorting by reversal. SIAM J. Comput. 25 (1996) 272-289
15. Baroni M., Semple C., and Steel M. A framework for representing reticulate evolution. Ann. Combin. 8 (2004) 391-408
16. Baroni M., Grunewald S., Moulton V., and Semple C. Bounding the number of hybridisation events for a consistent evolutionary history. J. Math. Biol. 51 (2005) 171-182
17. Berman P., and Hannenhalli S. Fast sorting by reversal. Proceedings Combinatorial Pattern Matching. Lecture Notes in Comput. Sci. vol. 1075 (1996), Springer-Verlag, Berlin 168-185
18. Birnbaum K., Shasha D.E., Wang J.Y., et al. A gene expression map of the Arabidopsis root. Science 302 (2003) 1956-1960
19. Blanchette M., Bourque G., Sankoff D., "Breakpoint phylogenies", in: Genome Informatics Workshop, GIW 1997, 1997, pp. 25-34
20. Blumenthal T., Evans D., Link C.D., et al. A global analysis of Caenorhabditis elegans operons. Nature 417 (2002) 851-854
21. Bonizzoni P., Della Vedova D., and Dondi R. Reconciling gene trees to a species tree. Proc. Italian Conference on Algorithms and Complexity, CIAC2003. Rome, Italy. Lecture Notes in Comput. Sci. vol. 2653 (2003), Springer-Verlag, Berlin 120-131
22. Bortoluzzi S., Rampoldi L., Simionati B., et al. A comprehensive, high-resolution genomic transcript map of human skeletal muscle. Genome Res. 8 (1998) 817-825
23. Boutanaev A.M., Kalmykova A.I., Shevelyov Y.Y., et al. Large clusters of co-expressed genes in the Drosophila genome. Nature 420 (2002) 666-669
24. Bourque G., and Pevzner P.A. Genome-scale evolution: reconstructing gene orders in the ancestral species. Genome Res. 12 (2002) 26-36
25. Bourque G., Zdobnov E.M., Bork P., Pevzner P.A., and Tesler G. Comparative architectures of mammalian and chicken genomes reveal highly variable rates of genomic rearrangements across different lineages. Genome Res. 15 1 (2005) 98-110
26. Bourque G., Yacef Y., and El-Mabrouk N. Maximizing synteny blocks to identify ancestral homologs. Proceedings of RECOMB Satellite Meeting on Comparative Genomics. Lecture Notes in Bioinform. vol. 3678 (2005), Springer-Verlag, Berlin 21-34
27. Brent M.R., and Guigó R. Recent advances in gene structure prediction. Curr. Opin. Struct. Biol. 14 3 (2004) 264-272
28. Bryant D., and Moulton V. NeighborNet: an agglomerative algorithm for the construction of phylogenetic networks. Mol. Biol. Evol. 21 2 (2004) 255-265
29. Bryant D. The complexity of calculating exemplar distance. In: Sankoff D., and Nadeau J.H. (Eds). Comparative Genomics (2000), Kluwer Academic Publishers, Dordrecht/Norwell, MA
30. Bulyk M.L. Computational prediction of transcription-factor binding site locations. Genome Biol. 5 1 (2003) 201
31. Caprara A., "Sorting by reversals is difficult", in: RECOMB '97: Proceedings of the 1st Annual International Conference on Computational Molecular Biology, 1997, pp. 75-83
32. Caprara A. The reversal median problem. INFORMS J. Computing 15 1 (2003) 93-113
33. Chen X., Zheng J., Fu Z., Nan P., Zhong Y., Lonardi S., and Jiang T. Assignment of orthologous genes via genome rearrangement. IEEE/ACM Trans. Comput. Biol. Bioinform. 2 (2005) 302-315
34. Chen Z.X., Fu B., Zhu B.H., "The approximability of the exemplar breakpoint distance problem", Manuscript, 2005
35. Chen K., Durand D., and Farach-Colton M. NOTUNG: a program for dating gene duplications and optimizing gene family trees. J. Comput. Biol. 7 3-4 (2000) 429-447
36. Cho R.J., Campbell M.J., Winzeler E.A., et al. A genome-wide transcriptional analysis of the mitotic cell cycle. Mol. Cell. 2 1 (1998) 65-73
37. Choy C., Jansson J., Sadakane K., et al. Computing the maximum agreement of phylogenetic networks. Theoret. Comput. Sci. 335 1 (2005) 93-107
38. Christie D.A. Sorting permutations by block-interchanges. Inform. Process. Lett. 60 4 (1996) 165-169
39. Cohen B.A., Mitra R.D., Hughes J.D., and Church G.M. A computational analysis of whole-genome expression data reveals chromosomal domains of gene expression. Nat. Genet. 26 2 (2000) 183-186
40. DasGupta B., Ferrarini S., Gopalakrishnan U., and Paryani N.R. Inapproximability results for the lateral gene transfer problem. Proc. 9th Italian Conf. on Theoret. Comput. Sci. ICTCS'05. Lecture Notes in Comput. Sci. vol. 3701 (2005), Springer-Verlag, Berlin 182-195
41. Darwin C. On the Origin of Species by Means of Natural Selection or the Preservation of Favored Races in the Struggle for Life (1859), John Murray, London
42. Daubin V., Lerat E., and Perrière G. The source of laterally transferred genes in bacterial genomes. Genome Biol. 4 9 (2003) R57
43. Diday E. Une représentation visuelle des classes empiétantes: les pyramides. RAIRO Autoat.-Prod. Inform. Ind. 20 (1984) 475-526
44. Doolittle W.F. Phylogenetic classification and the universal tree. Science 284 (1999) 2124-2149
45. Durand D., and Sankoff D. Tests for gene clustering. J. Comput. Biol. 10 (2003) 453-482
46. Durand D., Halldorsson B.V., Vernot B., "A hybrid micro-macroevolutionary approach to gene tree reconstruction", in: Proc. of RECOMB 2005, 2005, 250-264
47. Elemento O., and Gascuel O. An efficient and accurate distance based algorithm to reconstruct tandem duplication trees. Bioinformatics 18 Suppl. 2 (2002) S92-S99
48. Elemento O., and Gascuel O. An exact and polynomial distance-based algorithm to reconstruct single copy tandem duplication trees. Proceedings of the 4th Annual Symp. on Combinatorial Pattern Matching. CPM R03, Mexico. Lecture Notes in Comput. Sci. vol. 2676 (2003), Springer-Verlag, Berlin 96-108
49. Elemento O., Gascuel O., and Lefranc M.P. Reconstructing the duplication history of tandemly repeated genes. Mol. Biol. Evol. 19 3 (2002) 278-288
50. Elias I., and Hartman T. A 1.375-approximation algorithm for sorting by transpositions. Proceedings WABI. Lecture Notes in Bioinform. vol. 3692 (2005), Springer-Verlag, Berlin 204-215
51. Eulenstein O., Mirkin B., and Vingron M. Duplication-based measures of difference between gene and species trees. J. Comput. Biol. 5 1 (1998) 135-148
52. Fellows M., Hallett M., and Stege U. On the multiple gene duplication problem. Proc. the 9th Internat. Symp. on Algorithms and Comput. ISAAC '98. Lecture Notes in Comput. Sci. vol. 1533 (1999), Springer-Verlag, Berlin 347-356
53. Fitch W. Toward defining the course of evolution: minimum change for a specified tree topology. Syst. Zool. 20 (1971) 406-416
54. Fitch W. Phylogenies constrained by cross-over process as illustrated by human hemoglobins in a thirteen cycle, eleven amino-acid repeat in human apolipoprotein A-I. Genetics 86 (1977) 623-644
55. Fitch W. Networks and viral evolution. J. Mol. Evol. 44 (1997) S65-S75
56. Florens L., Washburn M.P., Raine J.D., et al. A proteomic view of the Plasmodium falciparum life cycle. Nature 419 (2002) 520-526
57. Foulds L., and Graham R. The Steiner problem in phylogeny is NP-completed. Adv. Appl. Math. 3 (1982) 43-49
58. Gascuel O., Hendy M.D., Jean-Marie A., and McLachlan R. The combinatorics of tandem duplication trees. Systematic Biol. 52 (2003) 110-118
59. Goodman M., Czelusniak J., Moore G.W., et al. Fitting the gene lineage into its species lineage, a parsimony strategy illustrated by cladograms constructed from globin sequences. Syst. Zool. 28 (1979) 132-163
60. Gorecki P., "Reconciliation problems for duplication, loss and horizontal gene transfer", in Proc. of RECOMB, 2004, pp. 316-325
61. Gorecki P., and Tiuryn T. On the structure of reconciliations. Proc. RECOMB Comparative Genomics Workshop 2004. Lecture Notes in Comput. Sci. vol. 3388 (2005), Springer-Verlag, Berlin 42-51
62. Grantham R., Gautier C., Gouy M., Mercier R., and Pave A. Codon catalog usage and the genome hypothesis. Nucleic Acids Res. 8 1 (1980) r49-r62
63. Guigó R., Muchnik I., and Smith T. Reconstruction of ancient molecular phylogeny. Mol. Phys. Evol. 6 2 (1996) 189-213
64. Gusfield D. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology (1997), Cambridge Univ. Press, Cambridge, UK
65. Gusfield D., and Bansal V. A fundamental decomposition theory for phylogenetic networks and incompatible characters. Lecture Notes in Comput. Sci. vol. 3500 (2005), Springer-Verlag, Berlin 217-232
66. Gusfield D. Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination. J. Comput. Syst. Sci. 70 3 (May 2005) 381-398
67. Gusfield D., Eddhu S., and Langley C. Optimal, efficient reconstruction of phylogenetic networks with constrained recombination. J. Bioinform. Comput. Biol. 2 1 (2004) 173-213
68. Gusfield D., Eddhu S., and Langley C. The fine structure of galls in phylogenetic networks. Inform. J. Comput. 16 4 (2004) 459-469
69. Gusfield D., "On the full-decomposition optimality conjecture for hylogenetic networks", Tech. Report CSE-2005, UC Davis, January 2005
70. Hallett M., Lagergren J., "Efficient algorithms for lateral gene transfer", in: Proc. of RECOMB'01, 2001, pp. 149-156
71. Hallett M., Lagergren J., Tofigh A., "Simultaneous identification of duplications and lateral transfer", in: Prof. of RECOMB'04, 2004, pp. 164-173
72. Hannenhalli S., Pevzner P.A., "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, 1995, pp. 178-189
73. Hannenhalli S., Pevzner P.A., "Transforming men into mice: polynomial algorithm for genomic distance problem", in: Proceedings of the 36th IEEE Symposium on Foundations of Computer Science, 1995, pp. 581-592
74. Hannenhalli S., and Pevzner P.A. Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J. ACM 46 (1999) 1-27
75. Hein J. Reconstructing the history of sequences subject to gene conversion and recombination. Math. Biosci. 98 (1990) 185-200
76. Hein J. A heuristic method to reconstruct the history of sequences subject to recombination. J. Mol. Evol. 20 (1993) 402-411
77. Heber S., and Stoye J. Finding all common intervals of k permutations. Proceedings of CPM 2001. Lecture Notes in Comput. Sci. vol. 2089 (2001), Springer-Verlag, Berlin 207-218
78. Hoberman R., Sankoff D., and Durand D. The statistical analysis of spatially clustered genes under the maximum gap criterion. J. Comput. Biol. 12 (2005) 1083-1102
79. Huang J., Mullapudi N., Sicheritz-Ponten T., and Kissinger J.C. A first glimpse into the pattern and scale of gene transfer in Apicomplexa. Internat. J. Parasitol. 34 3 (2004) 265-274
80. Hurst L.D., Pal C., and Lercher M.J. The evolutionary dynamics of eukaryotic gene order. Nat. Rev. Genet. 5 4 (2004) 299-310
81. Huson D. SplitsTree-a program for analyzing and visualizing evolutionary data. Bioinformatics 14 (1998) 68-73
82. Huson D.H., Klopper T., Lockhart P.J., et al. Reconstruction of reticulate networks from gene trees. Lecture Notes in Comput. Sci. vol. 3500 (2005), Springer-Verlag, Berlin 233-249
83. Huynh T.N.D., Jansson J., Nguyen N.B., et al. Constructing a smallest refining galled phylogenetic network. Lecture Notes in Comput. Sci. vol. 3500 (2005), Springer-Verlag, Berlin 265-280
84. Jaitly D., Kearney P., Lin G., and Ma B. Methods for reconstructing the history of tandem repeats and their application to the human genome. J. Comput. Syst. Sci. 65 3 (2002) 494-507
85. Kaplan H., Shamir R., Tarjan R.E., "Faster and simpler algorithm for sorting signed permutations by reversals", in: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, 1997, pp. 344-351
86. Karlin S., and Burge C. Dinucleotide relative abundance extremes: a genomic signature. Trends Genet. 11 7 (1995) 283-290
87. Kececioglu J.D., and Sankoff D. Efficient bounds for oriented chromosome inversion distance. Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching. CPM '94 (1994), Springer-Verlag, Berlin 307-325
88. Kececioglu J., Ravi R., "Of mice and men: algorithms for evolutionary distance between genomes with translocations", in: Proceedings of Sixth ACM-SIAM Symposium on Discrete Algorithms, 1995, pp. 604-613
89. Kececioglu J., and Sankoff D. Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement. Algorithmica 13 1-2 (1995) 180-210
90. Kleinjan D.J., and van Heyningen V. Position effect in human genetic disease. Human Mol. Genet. 7 10 (1998) 1611-1618
91. Ko M.S., Threat T.A., Wang X., et al. Genome-wide mapping of unselected transcripts from extraembryonic tissue of 7.5-day mouse embryos reveals enrichment in the t-complex and under-representation on the X chromosome. Human Mol. Genet. 7 (1998) 1967-1978
92. Kruglyak S., and Tang H. Regulation of adjacent yeast genes. Trends Genet. 16 3 (2000) 109-111
93. Kunin V., Goldovsky L., Darzentas N., et al. The net of life: Reconstructing the microbial phylogenetic network. Genome Res. 15 7 (2005) 954-959
94. Lander E.S., Linton L.M., Birren B., Nusbaum C., Zody M.C., Baldwin J., Devon K., Dewar K., Doyle M., FitzHugh W., et al. Initial sequencing and analysis of the human genome. Nature 409 6822 (2001 February 15) 860-921
95. Lawrence J.G., and Ochman H. Reconciling the many faces of lateral gene transfer. Trends Microbiol. 10 1 (2002) 1-4
96. Lercher M.J., Blumenthal T., and Hurst L.D. Coexpression of neighboring genes in Caenorhabditis elegans is mostly due to operons and duplicate genes. Genome Res. 13 2 (2003) 238-243
97. Lercher M.J., Urrutia A.O., and Hurst L.D. Clustering of housekeeping genes provides a unified model of gene order in the human genome. Nat. Genet. 31 2 (2002) 180-183
98. Lercher M.J., Urrutia A.O., Pavlicek A., and Hurst L.D. A unification of mosaic structures in the human genome. Human Mol. Genet. 12 19 (2003) 2411-2415
99. Levine M., and Tjian R. Transcription regulation and animal diversity. Nature 424 6945 (2003 July 10) 147-151
100. Li Q., Lee B.T., and Zhang L.X. Genome-scale analysis of positional clustering of mouse testis-specific genes. BMC Genomics 6 1 (2005) 7
101. Lin Y.C., Lu C.L., Chang H.Y., and Tang C.Y. An efficient algorithm for sorting by block-interchanges and its application to the evolution of vibrio species. J. Comput. Biol. 12 (2005) 102-112
102. Lu C.L., Wang T.C., Lin Y.C., and Tang C.Y. ROBIN: a tool for genome rearrangement of block-interchanges. Bioinformatics 21 11 (2005) 2780-2782
103. Ma B., Li M., and Zhang L.X. From gene trees to species trees. SIAM J. Comput. 30 (2000) 729-752
104. MacLeod D., Charlebois R.L., Doolittle F., and Bapteste E. Deduction of probable events of lateral gene transfer through comparison of phylogenetic trees by recursive consolidation and rearrangement. BMC Evol. Biol. 5 1 (2005) 27
105. Maddison W.P. Gene trees in species trees. Systemat. Biol. 46 3 (1997) 523-536
106. Mathe C., Sagot M.-F., Schiex T., and Rouze P. Current methods of gene prediction, their strengths and weaknesses. Nucleic Acids Res. 30 19 (2002) 4103-4117
107. Megy K., Audic S., and Claverie J.M. Positional clustering of differentially expressed genes on human chromosomes 20, 21 and 22. Genome Biol. 4 2 (2003) P1
108. Miller W., Makova K.D., Nekrutenko A., and Hardison R.C. Comparative genomics. Annu. Rev. Genom. Human Genet. 5 (2004) 15-56
109. Mirkin B., Muchnik I., and Smith T.F. A biologically consistent model for comparing molecular phylogenies. J. Comput. Biol. 2 4 (1995) 493-507
110. Mirkin B.G., Fenner T.I., Galperin M.Y., and Koonin E.V. Algorithms for computing parsimonious evolutionary scenarios for genome evolution, the last universal common ancestor and dominance of horizontal gene transfer in the evolution of prokaryotes. BMC Evol. Biol. 3 (2003) 2
111. Moret B.M.E., Nakhleh L., Warnow T., et al. Phylogenetic networks: Modeling, reconstructibility, and accuracy. IEEE/ACM Trans. Comput. Biol. Bioinform. 1 1 (2004) 13-23
112. Moret B.M.E., Wyman S., Bader D.A., Warnow T., Yan M., "A new implementation and detailed study of breakpoint analysis", in: 6th Pacific Symposium on Biocomputing, PSB 2001, 2001, pp. 583-594
113. Siepel A.C., and Moret B.M.E. Finding an optimal inversion median: experimental results. Algorithms in Bioinformatics, 1st International Workshop. WABI 2001. Lecture Notes in Comput. Sci. vol. 2149 (2001), Springer-Verlag, Berlin 189-203
114. Sturtevant A.H. Genetic studies on Drosophila simulans II. Sex-linked group of genes. Genetics 6 (1921) 43-64
115. Morrison D.A. Networks in phylogenetic analysis: new tools for population biology. Internat. J. Parasitol. 35 5 (2005) 567-582
116. Murphy W.J., Larkin D.M., Everts-van der Wind A., et al. Dynamics of mammalian chromosome evolution inferred from multispecies comparative maps. Science 309 5734 (2005) 613-617
117. Nakhleh L., Jin G., Zhao F., et al., "Reconstructing phylogenetic networks using maximum parsimony", in: Proc. the 2005 IEEE Computational Systems Bioinformatics Conference, 2005, pp. 93-102
118. Nakhleh L., Warnow T., Linder C.R., et al. Reconstructing reticulate evolution in species-theory and practice. J. Comput. Biol. 12 6 (2005) 796-811
119. Nelson K.E., Clayton R.A., Gill S.R., et al. Evidence for lateral gene transfer between Archaea and bacteria from genome sequence of Thermotoga maritima. Nature 399 (1999) 323-329
120. Nordborg M., and Tavaré S. Linkage disequilibrium: what history has to tell us. Trends Genet. 18 (2002) 83-90
121. Nguyen C.T., Nguyen N.B., Sung W.-K., Zhang L.X., "Reconstructing recombination network from sequence data: The small parsimony problem", Manuscript, 2005
122. Nguyen C.T., "The complexity and algorithms for the exemplar problem with gene family", Honors Thesis, School of Computing, National University of Singapore, 2005
123. Nguyen C.T., Tay Y.C., and Zhang L.X. Divide-and-conquer approach for the exemplar breakpoint distance. Bioinformatics 21 10 (2005) 2171-2176
124. O'Brien S.J., Menotti-Raymond M., Murphy W.J., et al. The promise of comparative genomics in mammals. Science 286 5439 (1999 October 15) 458-462 479-481
125. Ohno S. Evolution by Gene Duplication (1970), Springer-Verlag, Berlin
126. Oliver B., and Misteli T. A non-random walk through the genome. Genome Biol. 6 4 (2005) 214
127. Ozery-Flato M., and Shamir R. Two notes on genome rearrangement. J. Bioinform. Comput. Biol. 1 1 (2003) 71-94
128. Page R.D. Maps between trees and cladistic analysis of historical associations among genes, organisms, and areas. Syst. Biol. 43 (1994) 58-77
129. Page R.D., and Charleston M. From gene to organismal phylogeny: reconciled trees and the gene tree/species tree problem. Mol. Phys. Evol. 7 (1997) 231-240
130. Page R.D. GeneTree: comparing gene and species phylogenies using reconciled trees. Bioinformatics 14 9 (1998) 819-820
131. Page R.D. Extracting species trees from complex gene trees: reconciled trees and vertebrate phylogeny. Mol. Phylogenet. Evol. 14 1 (2000) 89-106
132. Page R.D., Cotton J.A., "Vertebrate phylogenomics: reconciled trees and gene duplications", in: Proc. of Pacific Symp. Biocomput., 2002, pp. 536-547
133. Pevzner P.A. Computational Molecular Biology: An Algorithmic Approach (2000), The MIT Press, Cambridge, MA (Chapter 10)
134. Posada D., and Crandall K.A. Intraspecific gene genealogies: trees grafting into networks. Trends Ecol. Evol. 16 1 (2001) 37-45
135. Reymond A., Marigo V., Yaylaoglu M.B., et al. Human chromosome 21 gene expression atlas in the mouse. Nature 420 6915 (2002) 582-586
136. Roy P.J., Stuart J.M., Lund J., and Kim S.K. Chromosomal clustering of muscle-expressed genes in Caenorhabditis elegans. Nature 418 (2002) 975-979
137. Sankoff D. Edit distances for genome comparisons based on non-local operations. Proc. of the 3rd Annual Symp. on Combin. Pattern Matching. CPM '92 (1992), Springer-Verlag, Berlin 121-135
138. Sankoff D., Sundaram G., and Kececioglu J. Steiner points in the space of genome rearrangements. Internat. J. Foundations Comput. Sci. 7 (1996) 1-9
139. Sankoff D., Blanchette M., "The median problem for breakpoints in comparative genomics", in: Computing and Combinatorics, Proceedings of COCOON '97, 1997, pp. 251-263
140. Sankoff D. Genome rearrangement with gene families. Bioinformatics 15 (1999) 909-917
141. Sankoff D., Zhang C.F., Lenert A., "Reversals of fortune", Manuscript, 2005
142. Semple C., and Steel M. Unicyclic networks: compatibility and enumeration. IEEE/ACM Trans. Comput. Biol. Bioinform. 3 (2006) 84-91
143. Setubal J., and Meidanis J. Introduction to Computational Molecular Biology (1997), PWS Publishing Company (Chapter 7)
144. Smith G.P. Evolution of repeated DNA sequences by unequal crossover. Science 191 (1976) 58-535
145. Smith D.R., Doucette-Stamm L.A., Deloughery C., et al. Complete genome sequence of Methanobacterium thermoautotrophicum deltaH: functional analysis and comparative genomics. J. Bacteriol. 179 22 (1997) 7135-7155
146. Snyder M., and Gerstein M. Genomics. Defining genes in the genomics era. Science 300 5617 (2003 April 11) 258-260
147. Song Y.S., and Hein J. Constructing minimal ancestral recombination graphs. J. Comput. Biol. 12 2 (2005) 147-169
148. Spellman P.T., and Rubin G.M. Evidence for large domains of similarly expressed genes in the Drosophila genome. J. Biol. 1 (2002) 5
149. Stege U. Gene trees and species trees: The gene-duplication problem is fixed-parameter tractable. Proc. of the 6th Internat. Workshop on Algorithms and Data Structures. WADS '99, August 1999. Lecture Notes in Comput. Sci. vol. 1663 (1999), Springer-Verlag, Berlin
150. Sturtevant A.H., and Novitski E. The homologies of chromosome elements in the genus drosophila. Genetics 26 (1941) 517-541
151. Swenson K.M., Pattengale N.D., and Moret B.M.E. A framework for orthology assignment from gene rearrangement data. Proceedings of RECOMB 2005 Workshop on Comparative Genomics. Lecture Notes in Bioinform. vol. 3678 (2005), Springer-Verlag, Berlin 153-166
152. Tang M., Waterman M., and Yooseph S. Zinc finger gene clusters and tandem gene duplication. J. Comput. Biol. 9 2 (2002) 429-446
153. Templeton A., Crandall K., and Sing C. A cladistic analysis of phenotypic association with haplotype inferred from restriction endonuclease mapping and DNA sequence data. III. Cladogram estimation. Genetics 132 (1992) 619-633
154. Tesler G. Efficient algorithms for multichromosomal genome rearrangements. J. Comput. Syst. Sci. 65 3 (2002) 587-609
155. Tesler G. GRIMM: genome rearrangements web server. Bioinformatics 18 3 (2002) 492-493
156. Uno T., and Yagiura M. Fast algorithms to enumerate all common intervals of two permutations. Algorithmica 26 2 (2000) 290-309
157. Versteeg R., van Schaik B.D., van Batenburg M.F., et al. The human transcriptome map reveals extremes in gene density, intron length, GC content, and repeat pattern for domains of highly and weakly expressed genes. Genome Res. 13 9 (2003) 1998-2004
158. Walter M.E.T., Dias Z., Meidanis J., "A new approach for approximating the transposition distance", in: Proceedings SPIRE, 2000, pp. 199-208
159. Waterston R.H., Lindblad-Toh K., Birney E., et al. Initial sequencing and comparative analysis of the mouse genome. Nature 420 6915 (2002 December 5) 520-562
160. Williams E.J., and Bowles D.J. Coexpression of neighboring genes in the genome of Arabidopsis thaliana. Genome Res. 14 6 (2004) 1060-1067
161. Wang L.S., Zhang K.Z., and Zhang L.X. Perfect phylogenetic networks with recombination. J. Comput. Biol. 8 1 (2001) 69-78
162. Watterson G.A., Ewens W.J., Hall T.E., and Morgan A. The chromosome inversion problem. J. Theoret. Biol. 99 (1982) 1-7
163. Yang J., and Zhang L.X. On counting tandem duplication trees. Mol. Biol. Evol. 21 6 (2004) 1160-1163
164. Yang Y.S., Song H.D., Shi W.J., et al. Chromosome localization analysis of genes strongly expressed in human visceral adipose tissue. Endocrine 18 1 (2002) 57-66
165. Yancopoulos S., Attie O., and Friedberg R. Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21 16 (2005) 3340-3346
166. Zhang L.X. On a Mirkin-Muchnik-Smith conjecture for comparing molecular phylogenies. J. Comput. Biol. 4 (1997) 177-188
167. Zhang L.X., Ma B., Wang L., and Xu Y. Greedy method for inferring tandem duplication history. Bioinformatics 19 (2003) 1497-1504
168. Zheng C., Lenert A., and Sankoff D. Reversal distance for partially ordered genomes. Bioinformatics 21 Suppl. 1 (2005) i502-i508
169. Zheng C., and Sankoff D. Genome rearrangements with partially ordered chromosomes. Proceeding of COCOON 2005. Lecture Notes in Comput. Sci. vol. 3595 (2005), Springer-Verlag, Berlin 52-62
170. Zmasek C.M., and Eddy S.R. A simple algorithm to infer gene duplication and speciation events on a gene tree. Bioinformatics 17 9 (2001) 821-828
171. Zhaxybayeva O., and Gogarten J.P. An improved probability mapping approach to assess genome mosaicism. BMC Genomics 4 1 (2003) 37