Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
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 Roytberg, M. A.
Right arrow Articles by Kondrashov, A. S.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Roytberg, M. A.
Right arrow Articles by Kondrashov, A. S.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 18 no. 12 2002
Pages 1673-1680
© 2002 Oxford University Press

A hierarchical approach to aligning collinear regions of genomes

Mikhail A. Roytberg 1, Aleksey Y. Ogurtsov 2, Svetlana A. Shabalina 2 and Alexey S. Kondrashov 2,*

1 Institute of Mathematical Problems in Biology, Pushchino, Moscow Region 142290, Russia
2 National Center for Biotechnology Information, NIH, 45 Center Drive, Bethesda, MD 20892-6510, USA

Received on February 4, 2002 ; revised on May 9, 2002 ; accepted on May 21, 2002

Motivation: As a first approximation, similarity between two long orthologous regions of genomes can be represented by a chain of local similarities. Within such a chain, pairs of successive similarities are collinear (non-conflicting), i.e. segments involved in the nth similarity precede in both sequences segments involved in the (n+1)th similarity. However, when all similarities between two long sequences are considered, usually there are many conflicts between them. Although some conflicts can be avoided by masking transposons or low-complexity sequences, selecting only those similarities that reflect orthology and, thus, belong to the evolutionarily true chain is not trivial.

Results: We propose a simple, hierarchical algorithm of finding the true chain of local similarities. Starting from similarities with low P-values, we resolve each pairwise conflict by deleting a similarity with a higher P-value. This greedy approach constructs a chain of similarities faster than when a chain optimal with respect to some global criterion is sought, and makes more sense biologically.

Availability: A software tool OWEN based on the proposed approach is described in the accompanying note and is freely available at ftp://ftp.ncbi.nih.gov/pub/kondrashov/owen

Contact: kondrashov{at}ncbi.nlm.nih.gov

Supplementary information: Algorithm Chain and examples of chains of local similarities are available at ftp://ftp.ncbi.nih.gov/pub/kondrashov/owen/extra

* To whom correspondence should be addressed.


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
 BioinformaticsHome page
A. Y. Ogurtsov, S. A. Shabalina, A. S. Kondrashov, and M. A. Roytberg
Analysis of internal loops within the RNA secondary structure in almost quadratic time
Bioinformatics, June 1, 2006; 22(11): 1317 - 1324.
[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.