Alignment

Aligning RNA sequences is computationaly expensive when only nucleotide sequences are given but their secondary structures are not given. Because we would like to estimate an optimal alignment and an optimal common secondary structure in a same time. Sankoff's algorithm has been known as a solution to this problem since very early era of Bioinformatics. However, it is only too expensive algorithm to compute even on today's computers. Many new algorithms are developed in this category.

Global Alignment — by admin — last modified 2006-10-27 22:25

 

Local Alignment — by admin — last modified 2006-10-27 22:25

 

Genome Comparison — by admin — last modified 2006-10-27 22:25

 

Sankoff's Algorithm — by admin — last modified 2006-10-27 22:25

Sankoff's algorithm is a famous algorithm for aligning multiple RNA sequences. Though it is infamous for its O(L^6) computational time. (This content is written in Japanese)