Skip Navigation



Bioinformatics Advance Access published online on September 16, 2004
Bioinformatics, doi:10.1093/bioinformatics/bth468
Bioinformatics © Oxford University Press 2004; all rights reserved
This Article
Right arrow Advance Access manuscript (PDF) Freely available
Right arrow All Versions of this Article:
21/1/20    most recent
bth468v1
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 Lu, C. L.
Right arrow Articles by Huang, Y. P.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Lu, C. L.
Right arrow Articles by Huang, Y. P.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Received April 20, 2004
Revised July 16, 2004
Accepted August 3, 2004

Article

A memory-efficient algorithm for multiple sequence alignment with constraints

Chin Lung Lu 1* and Yen Pin Huang 1

1 Department of Biological Science and Technology, National Chiao Tung University, Hsinchu 300, Taiwan, ROC

* To whom correspondence should be addressed. E-mail: cllu{at}mail.nctu.edu.tw.


  Abstract

Motivation: Recently, the concept of the constrained sequence alignment was proposed to incorporate the knowledge of biologists about structures/functionalities/consensuses of their datasets into sequence alignment such that the user-specified residues/nucleotides should be aligned together in the computed alignment. The currently developed programs use the so-called progressive approach to efficiently obtain a constrained alignment of several sequences. However, the kernels of these programs, the dynamic programming algorithms for computing an optimal constrained alignment between two sequences, run in O({gamma}n2) memory, where {gamma} is the number of the constraints and n is the maximum of the lengths of sequences. As a result, such a high memory requirement limits the overall programs to align short sequences only.

Results: We adopt the divide-and-conquer approach to design a memory-efficient algorithm for computing an optimal constrained alignment between two sequences, which greatly reduces the memory requirement of the dynamic programming approaches at the expense of a small constant factor in CPU time. This new algorithm consumes only O({alpha}n) space, where {alpha} is the sum of the lengths of constraints and usually {alpha} << n in practical applications. Based on this algorithm, we have developed a memory-efficient tool for multiple sequence alignment with constraints.

Availability: http://genome.life.nctu.edu.tw/MUSICME.


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
 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.