MSARC: Multiple sequence alignment by residue clustering

Citations of this article
Mendeley users who have this article in their library.

This artice is free to access.


Background: Progressive methods offer efficient and reasonably good solutions to the multiple sequence alignment problem. However, resulting alignments are biased by guide-trees, especially for relatively distant sequences.Results: We propose MSARC, a new graph-clustering based algorithm that aligns sequence sets without guide-trees. Experiments on the BAliBASE dataset show that MSARC achieves alignment quality similar to the best progressive methods.Furthermore, MSARC outperforms them on sequence sets whose evolutionary distances are difficult to represent by a phylogenetic tree. These datasets are most exposed to the guide-tree bias of alignments.Availability: MSARC is available at © 2014 Modzelewski and Dojer; licensee BioMed Central Ltd.




Modzelewski, M., & Dojer, N. (2014). MSARC: Multiple sequence alignment by residue clustering. Algorithms for Molecular Biology, 9(1).

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free