Skip Navigation


Bioinformatics Advance Access originally published online on December 7, 2004
Bioinformatics 2005 21(8):1339-1348; doi:10.1093/bioinformatics/bti168
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow All Versions of this Article:
21/8/1339    most recent
bti168v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (5)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Hampson, S. E.
Right arrow Articles by Baldi, P.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Hampson, S. E.
Right arrow Articles by Baldi, P.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2004. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions{at}oupjournals.org

Statistical detection of chromosomal homology using shared-gene density alone

S. E. Hampson 1,3, B. S. Gaut 2,3 and P. Baldi 1,3,*

1School of Information and Computer Science, University of California Irvine, Irvine CA 92697, USA
2Department of Ecology and Evolutionary Biology, University of California Irvine, Irvine CA 92697, USA
3Institute for Genomics and Bioinformatics, University of California Irvine, Irvine CA 92697, USA

*To whom correspondence should be addressed.

Motivation: Over evolutionary time, various processes including point mutations and insertions, deletions and inversions of variable sized segments progressively degrade the homology of duplicated chromosomal regions making identification of the homologous regions correspondingly difficult. Existing algorithms that attempt to detect homology are based on shared-gene density and colinearity and possibly also strand information.

Results: Here, we develop a new algorithm for the statistical detection of chromosomal homology, CloseUp, which uses shared-gene density alone to fully exploit the observation that relaxing colinearity requirements in general is beneficial for homology detection and at the same time optimizes computation time. CloseUp has two components: the identification of candidate homologous regions followed by their statistical evaluation using Monte Carlo methods and data randomization. Using both artificial and real data, we compared CloseUp with two existing programs (ADHoRe and LineUp) for chromosomal homology detection and found that in general CloseUp compares favorably.

Availability: CloseUp and supplementary information are available at http://www.igb.uci.edu/servers/cgss.html

Contact: pfbaldi{at}ics.uci.edu


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 Genome ResHome page
H. Tang, X. Wang, J. E. Bowers, R. Ming, M. Alam, and A. H. Paterson
Unraveling ancient hexaploidy through multiply-aligned angiosperm gene maps
Genome Res., December 1, 2008; 18(12): 1944 - 1954.
[Abstract] [Full Text] [PDF]

Home page
 Plant CellHome page
J. Salse, S. Bolot, M. Throude, V. Jouffe, B. Piegu, U. M. Quraishi, T. Calcagno, R. Cooke, M. Delseny, and C. Feuillet
Identification and Characterization of Shared Duplications between Rice and Wheat Provide New Insight into Grass Genome Evolution
PLANT CELL, January 1, 2008; 20(1): 11 - 24.
[Abstract] [Full Text] [PDF]


Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.