Skip Navigation



Bioinformatics Advance Access published online on July 26, 2006

Bioinformatics, doi:10.1093/bioinformatics/btl398
This Article
Right arrow Advance Access manuscript (PDF) Freely available
Right arrow All Versions of this Article:
22/19/2326    most recent
btl398v1
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 Song, B.
Right arrow Articles by Yang, J.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Song, B.
Right arrow Articles by Yang, J.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author (2006). Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org
Received November 14, 2005
Revised June 6, 2006
Accepted July 18, 2006

Article

ARCS: an aggregated related column scoring scheme for aligned sequences

Bin Song 1 #, Jeong-Hyeon Choi 2 #, Guangyu Chen 1, Jacek Szymanski 1, Guo-Qiang Zhang 1, Anthony K. H. Tung 3, Jaewoo Kang 4, Sun Kim 2, and Jiong Yang 1 *

1 Electrical Engineering and Computer Science Department, Case Western Reserve University, Cleveland, USA
2 School of Informatics, Indiana University, Bloomington, USA
3 Department of Computer Science, National University of Singapore, Singapore
4 Department of Computer Science, NC State University, Raleigh, USA

* To whom correspondence should be addressed.
Jiong Yang, E-mail: jiong.yang{at}case.edu


   Abstract

Motivation: Biologists frequently align multiple biological sequences to determine consensus sequences and/or search for predominant residues and conserved regions. Particularly, determining conserved regions in an alignment is one of the most important activities. Since protein sequences are often several-hundred residues or longer, it is difficult to distinguish biologically important conserved regions (motifs or domains) from others. The widely used tools, Logos, Al2co, Confind, and the entropy-based method, often fail to highlight such regions. Thus a computational tool that can highlight biologically important regions accurately will be highly desired.

Results: This paper presents a new scoring scheme ARCS (Aggregated Related Column Score) for aligned biological sequences. ARCS method considers not only the traditional character similarity measure but also column correlation. In an extensive experimental evaluation using 533 PROSITE patterns, ARCS is able to highlight the motif regions with up to 77.7% accuracy corresponding to the top 3 peaks.

Availability: The source code is available on http://bio.informatics.indiana.edu/projects/arcs.

Supplementary Material: http://bio.informatics.indiana.edu/projects/arcs.


Associate Editor: Christos Ouzounis

#These two authors contribute to the paper equally.


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
S. Zhang, W. Su, and J. Yang
ARCS-Motif: discovering correlated motifs from unaligned biological sequences
Bioinformatics, January 15, 2009; 25(2): 183 - 189.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
Y.-S. Chung, W.-H. Lee, C. Y. Tang, and C. L. Lu
RE-MuSiC: a tool for multiple sequence alignment with regular expression constraints
Nucleic Acids Res., July 13, 2007; 35(suppl_2): W639 - W644.
[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.