Skip Navigation


Bioinformatics Advance Access originally published online on November 13, 2005
Bioinformatics 2006 22(1):29-34; doi:10.1093/bioinformatics/bti772
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow Supplementary Data
Right arrow All Versions of this Article:
22/1/29    most recent
bti772v1
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 (4)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Huang, W.
Right arrow Articles by Li, L.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Huang, W.
Right arrow Articles by Li, L.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Published by Oxford University Press 2005

Accurate anchoring alignment of divergent sequences

Weichun Huang 1,2,3, David M. Umbach 1 and Leping Li 1,*

1Biostatistics Branch, The National Institute of Environmental Health Sciences RTP, NC 27709 USA
2Bioinformatics Research Center, North Carolina State University Raleigh, NC 27606 USA
3Institute for Genome Sciences & Policy, Duke University Medical Center Durham, NC 27708 USA

*To whom correspondence should be addressed.

Motivation: Obtaining high quality alignments of divergent homologous sequences for cross-species sequence comparison remains a challenge.

Results: We propose a novel pairwise sequence alignment algorithm, ACANA (ACcurate ANchoring Alignment), for aligning biological sequences at both local and global levels. Like many fast heuristic methods, ACANA uses an anchoring strategy. However, unlike others, ACANA uses a Smith–Waterman-like dynamic programming algorithm to recursively identify near-optimal regions as anchors for a global alignment. Performance evaluations using a simulated benchmark dataset and real promoter sequences suggest that ACANA is accurate and consistent, especially for divergent sequences. Specifically, we use a simulated benchmark dataset to show that ACANA has the highest sensitivity to align constrained functional sites compared to BLASTZ, CHAOS and DIALIGN for local alignment and compared to AVID, ClustalW, DIALIGN and LAGAN for global alignment. Applied to 6007 pairs of human-mouse orthologous promoter sequences, ACANA identified the largest number of conserved regions (defined as over 70% identity over 100 bp) compared to AVID, ClustalW, DIALIGN and LAGAN. In addition, the average length of conserved region identified by ACANA was the longest. Thus, we suggest that ACANA is a useful tool for identifying functional elements in cross-species sequence analysis, such as predicting transcription factor binding sites in non-coding DNA.

Availability: ACANA software and test sequence data are publicly available at http://BioMedEmpire.org/

Supplementary information: Supplementary materials are available at Bioinformatics online.

Contact: li3{at}niehs.nih.gov

Received on July 1, 2005; revised on October 14, 2005; accepted on November 8, 2005

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
W. Huang and G. Marth
EagleView: A genome assembly viewer for next-generation sequencing technologies
Genome Res., September 1, 2008; 18(9): 1538 - 1543.
[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.