2003Journal of Bioinformatics and Computational BiologyRequires access

Constrained Multiple Sequence Alignment Tool Development and Its Application to RNase Family Alignment

Chuan Yi Tang, Chin Lung Lu, Margaret Dah‐Tsyr Chang, Yin-Te Tsai, Yuh-Ju Sun, Kun‐Mao Chao, Jia‐Ming Chang, Yu-Han Chiou, Chia-Mao Wu, Hao‐Teng Chang, Wei-I Chou

Open publisher page 53 citations

Abstract

In this paper, we design a heuristic algorithm of computing a constrained multiple sequence alignment (CMSA for short) for guaranteeing that the generated alignment satisfies the user-specified constraints that some particular residues should be aligned together. If the number of residues needed to be aligned together is a constant alpha, then the time-complexity of our CMSA algorithm for aligning K sequences is O(alphaKn(4)), where n is the maximum of the lengths of sequences. In addition, we have built up such a CMSA software system and made several experiments on the RNase sequences, which mainly function in catalyzing the degradation of RNA molecules. The resulting alignments illustrate the practicability of our method.

About this research paper

What this paper is about

In this paper, we design a heuristic algorithm of computing a constrained multiple sequence alignment (CMSA for short) for guaranteeing that the generated alignment satisfies the user-specified constraints that some particular residues should be aligned together. If the number of residues needed to be aligned together is a constant alpha, then the time-complexity of our CMSA algorithm for aligning K sequences is O(alphaKn(4)), where n is the maximum of the lengths of sequences. In addition, we have built up such a CMSA software system and made several experiments on the RNase sequences, which mainly function in catalyzing the degradation of RNA molecules. The resulting alignments illustrate the practicability of our method.

Why it matters

OpenAlex reports 53 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper, we design a heuristic algorithm of computing a constrained multiple sequence alignment (CMSA for short) for guaranteeing that the generated alignment satisfies the user-specified constraints that some particular residues should be aligned together. If the number of residues needed to be aligned together is a constant alpha, then the time-complexity of our CMSA algorithm for aligning K sequences is O(alphaKn(4)), where n is the maximum of the lengths of sequences. In addition, we have built up such a CMSA software system and made several experiments on the RNase sequences, which mainly function in catalyzing the degradation of RNA molecules. The resulting alignments illustrate the practicability of our method.

Key concepts: Multiple sequence alignment, Sequence (biology), Heuristic, RNase P, Sequence alignment, Computer science, Structural alignment, Function (biology)

Related papers

Back to paper searchBrowse research topicsOriginal source
Constrained Multiple Sequence Alignment Tool Development and Its Application to RNase Family Alignment — Research Paper | ScholarLens