Tests for Gene Clusters Satisfying the Generalized Adjacency Criterion | SpringerLink
Skip to main content

Tests for Gene Clusters Satisfying the Generalized Adjacency Criterion

  • Conference paper
Advances in Bioinformatics and Computational Biology (BSB 2008)

Part of the book series: Lecture Notes in Computer Science ((LNBI,volume 5167))

Included in the following conference series:

Abstract

We study a parametrized definition of gene clusters that permits control over the trade-off between increasing gene content versus conserving gene order within a cluster. This is based on the notion of generalized adjacency, which is the property shared by any two genes no farther apart, in the linear order of a chromosome, than a fixed threshold parameter θ. Then a cluster in two or more genomes is just a maximal set of markers, where in each genome these markers form a connected chain of generalized adjacencies. Since even pairs of randomly constructed genomes may have many generalized adjacency clusters in common, we study the statistical properties of generalized adjacency clusters under the null hypothesis that the markers are ordered completely randomly on the genomes. We derive expresions for the exact values of the expected number of clusters of a given size, for large and small values of the parameter. We discover through simulations that the trend from small to large clusters as a function of the parameter theta exhibits a “cut-off” phenomenon at or near \(\sqrt{\theta}\) as genome size increases.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Bergeron, A., Corteel, S., Raffinot, M.: The algorithmic of gene teams. In: Guigó, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol. 2452, pp. 464–476. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Durand, D., Sankoff, D.: Tests for gene clustering. Journal of Computational Biology 10, 453–482 (2003)

    Article  Google Scholar 

  3. Hoberman, R., Sankoff, D., Durand, D.: The statistical analysis of spatially clustered genes under the maximum gap criterion. Journal of Computational Biology 12, 1081–1100 (2005)

    Article  Google Scholar 

  4. Wolfowitz, J.: Note on runs of consecutive elements. Annals of Mathematical Statistics 15, 97–98 (1944)

    Article  MATH  MathSciNet  Google Scholar 

  5. Xu, W., Alain, B., Sankoff, D.: Poisson adjacency distributions in genome comparison: multichromosomal, circular, signed and unsigned cases. Bioinformatics 24 (2008)

    Google Scholar 

  6. Zhu, Q., Adam, Z., Choi, V., Sankoff, D.: Generalized gene adjacencies, graph bandwidth and clusters in yeast evolution. In: Mandoiu, I., Sunderraman, R., Zelikovsky, A. (eds.) ISBRA 2008. LNCS (LNBI), vol. 4983, pp. 134–145. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Ana L. C. Bazzan Mark Craven Natália F. Martins

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xu, X., Sankoff, D. (2008). Tests for Gene Clusters Satisfying the Generalized Adjacency Criterion. In: Bazzan, A.L.C., Craven, M., Martins, N.F. (eds) Advances in Bioinformatics and Computational Biology. BSB 2008. Lecture Notes in Computer Science(), vol 5167. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85557-6_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85557-6_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85556-9

  • Online ISBN: 978-3-540-85557-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics