A memory-efficient algorithm for multiple sequence alignment with constraints | Zendy

Chin Lung Lu | Zendy; Yen Pin Huang | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A memory-efficient algorithm for multiple sequence alignment with constraints

Author(s) -

Chin Lung Lu,

Yen Pin Huang

Publication year - 2004

Publication title -

bioinformatics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 3.599

H-Index - 390

eISSN - 1367-4811

pISSN - 1367-4803

DOI - 10.1093/bioinformatics/bth468

Subject(s) - computer science , dynamic programming , sequence (biology) , multiple sequence alignment , algorithm , divide and conquer algorithms , sequence alignment , time complexity , parallel computing , biochemistry , chemistry , biology , gene , peptide sequence , genetics

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 (gamman2) 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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research