Please use this identifier to cite or link to this item:
|Title:||Bidirectional best hit r-window gene clusters||Authors:||Zhang, M.
|Issue Date:||2010||Citation:||Zhang, M., Leong, H.W. (2010). Bidirectional best hit r-window gene clusters. BMC Bioinformatics 11 (SUPPLL.1). ScholarBank@NUS Repository. https://doi.org/10.1186/1471-2105-11-S1-S63||Abstract:||Background: Conserved gene clusters are groups of genes that are located close to one another in the genomes of several species. They tend to code for proteins that have a functional interaction. The identification of conserved gene clusters is an important step towards understanding genome evolution and predicting gene function.Results: In this paper, we propose a novel pairwise gene cluster model that combines the notion of bidirectional best hits with the r-window model introduced in 2003 by Durand and Sankoff. The bidirectional best hit (BBH) constraint removes the need to specify the minimum number of shared genes in the r-window model and improves the relevance of the results. We design a subquadratic time algorithm to compute the set of BBH r-window gene clusters efficiently.Conclusion: We apply our cluster model to the comparative analysis of E. coli K-12 and B. subtilis and perform an extensive comparison between our new model and the gene teams model developed by Bergeron et al. As compared to the gene teams model, our new cluster model has a slightly lower recall but a higher precision at all levels of recall when the results were ranked using statistical tests. An analysis of the most significant BBH r-window gene cluster show that they correspond to known operons. © 2010 Zhang and Leong; licensee BioMed Central Ltd.||Source Title:||BMC Bioinformatics||URI:||http://scholarbank.nus.edu.sg/handle/10635/39616||ISSN:||14712105||DOI:||10.1186/1471-2105-11-S1-S63|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
|2010-bidirectional_best_hit_r_window-published.pdf||485.54 kB||Adobe PDF|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.