Abstract

For multiple sequence alignment problem in molecular biological sequence analysis, when input sequence number is very large, many heuristic algorithms have been proposed to improve the computation speed and the quality of alignment. We present a novel algorithm SASAlign for multiple sequence alignment. This can guarantee that the multiple alignment obtained from the SASAlign is within a factor of two from the optimal multiple sequence alignment. Experimental results show that the proposed algorithm is feasible, as the SASAlign algorithm outperforms the HMMT and SA for most of the cases and is competitive with the other methods, such as ClustalW, SAGA, MultAlign, and DiAlign.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.