IEEE Computer Society Bioinformatics Conference (CSB'02) Constrained Multiple Sequence Alignment Tool Development and Its Application to RNase Family Alignment Stanford, California August 14-August 16 ISBN: 0-7695-1653-X
In this paper, we design an algorithm of computing a constraine 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 α, then the time-complexity of our CMSA algorithm for aligning K sequences is O (αKn4), where n is the maximum of the lengths of sequences. In addition, we have build 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.
Citation:
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, "Constrained Multiple Sequence Alignment Tool Development and Its Application to RNase Family Alignment," csb, pp.127, IEEE Computer Society Bioinformatics Conference (CSB'02), 2002 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||