標題: A memory-efficient algorithm for multiple sequence alignment with constraints
作者: Lu, CL
Huang, YP
生物科技學系
Department of Biological Science and Technology
公開日期: 1-Jan-2005
摘要: 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 are 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(gamman (2)) 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(alphan) 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.
URI: http://dx.doi.org/10.1093/bioinformatics/bth468
http://hdl.handle.net/11536/25355
ISSN: 1367-4803
DOI: 10.1093/bioinformatics/bth468
期刊: BIOINFORMATICS
Volume: 21
Issue: 1
起始頁: 20
結束頁: 30
Appears in Collections:Articles


Files in This Item:

  1. 000226188800004.pdf