Skip Navigation


Bioinformatics Advance Access originally published online on June 19, 2009
Bioinformatics 2009 25(17):2188-2193; doi:10.1093/bioinformatics/btp372
This Article
Right arrow Full Text
Right arrow Full Text (Print PDF)
Right arrow All Versions of this Article:
25/17/2188    most recent
btp372v1
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 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 arrowRequest Permissions
Google Scholar
Right arrow Articles by Chu, T.-C.
Right arrow Articles by Shih, A. C.-C.
PubMed
Right arrow PubMed Citation
Right arrow Articles by Chu, T.-C.
Right arrow Articles by Shih, A. C.-C.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2009. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

GR-Aligner: an algorithm for aligning pairwise genomic sequences containing rearrangement events

Te-Chin Chu 1,2, Tsunglin Liu 3, D. T. Lee 1,4,5, Greg C. Lee 2 and Arthur Chun-Chieh Shih 1,4,*

1 Institute of Information Science, Academia Sinica, 2 Department of Computer Science and Information Engineering, National Taiwan Normal University, 3 Biodiversity Research Center, 4 Research Center for Information Technology Innovation, Academia Sinica and 5 Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan

* To whom the correspondence should be addressed.


  Abstract

Motivation: Homologous genomic sequences between species usually contain different rearrangement events. Whether some specific patterns existed in the breakpoint regions that caused such events to occur is still unclear. To resolve this question, it is necessary to determine the location of breakpoints at the nucleotide level. The availability of sequences near breakpoints would further facilitate the related studies. We thus need a tool that can identify breakpoints and align the neighboring sequences. Although local alignment tools can detect rearrangement events, they only report a set of discontinuous alignments, where the detailed alignments in the breakpoint regions are usually missing. Global alignment tools are even less appropriate for these tasks since most of them are designed to align the conserved regions between sequences in a consistent order, i.e. they do not consider rearrangement events.

Results: We propose an effective and efficient pairwise sequence alignment algorithm, called GR-Aligner (Genomic Rearrangement Aligner), which can find breakpoints of rearrangement events by integrating the forward and reverse alignments of the breakpoint regions flanked by homologously rearranged sequences. In addition, GR-Aligner also provides an option to view the alignments of sequences extended to the breakpoints. These outputs provide materials for studying possible evolutionary mechanisms and biological functionalities of the rearrangement.

Availability: http://biocomp.iis.sinica.edu.tw/new/GR_Aligner.htm

Contact: arthur{at}iis.sinica.edu.tw

Associate Editor: John Quakenbush

Received on January 12, 2009; revised on June 9, 2009; accepted on June 11, 2009

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




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.