Abstract
Whole genome comparison based on the analysis of gene cluster conservation has become a popular approach in comparative genomics. While gene order and gene content as a whole randomize over time, it is observed that certain groups of genes which are often functionally related remain co-located across species. However, the conservation is usually not perfect which turns the identification of these structures, often referred to as approximate gene clusters, into a challenging task. In this paper, we present a polynomial time algorithm that computes approximate gene clusters based on reference occurrences. We show that our approach yields highly comparable results to a more general approach and allows for approximate gene cluster detection in parameter ranges currently not feasible for non-reference based approaches.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amir, A., Gasieniec, L., Shalom, R.: Improved approximate common interval. Inf. Process. Lett. 103(4), 142–149 (2007)
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)
Böcker, S., Jahn, K., Mixtacki, J., Stoye, J.: Computation of median gene clusters. J. Comp. Biol. 16(8), 1085–1099 (2009)
He, X., Goldwasser, M.H.: Identifying conserved gene clusters in the presence of homology families. J. Comp. Biol. 12, 638–656 (2005)
Jahn, K.: Approximate Common Intervals Based Gene Cluster Models. PhD thesis, Bielefeld University, Bielefeld (2010)
Ling, X., He, X., Xin, D.: Detecting gene clusters under evolutionary constraint in a large number of genomes. Bioinformatics 25(5), 571 (2009)
Ma, B., Sun, X.: More efficient algorithms for closest string and substring problems. In: Vingron, M., Wong, L. (eds.) RECOMB 2008. LNCS (LNBI), vol. 4955, pp. 396–409. Springer, Heidelberg (2008)
Pruitt, K.D., Tatusova, T., Maglott, D.R.: NCBI reference sequences (RefSeq): a curated non-redundant sequence database of genomes, transcripts and proteins. Nucleic Acids Res. (2006)
Rahmann, S., Klau, G.W.: Integer linear programs for discovering approximate gene clusters. In: Bücher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS (LNBI), vol. 4175, pp. 298–309. Springer, Heidelberg (2006)
Schmidt, T., Stoye, J.: Quadratic time algorithms for finding common intervals in two and more sequences. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol. 3109, pp. 347–358. Springer, Heidelberg (2004)
Schmidt, T., Stoye, J.: Gecko and GhostFam – rigorous and efficient gene cluster detection in prokaryotic genomes. In: Bergman, N. (ed.) Comparative Genomics, ch. 12. Methods in Molecular Biology, vol. 2, pp. 165–182. Humana Press, Totowa (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jahn, K. (2010). Efficient Computation of Approximate Gene Clusters Based on Reference Occurrences. In: Tannier, E. (eds) Comparative Genomics. RECOMB-CG 2010. Lecture Notes in Computer Science(), vol 6398. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16181-0_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-16181-0_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16180-3
Online ISBN: 978-3-642-16181-0
eBook Packages: Computer ScienceComputer Science (R0)