Multiple alignment of protein sequences with repeats and rearrangements

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

This article is free to access.

Abstract

Multiple sequence alignments are the usual starting point for analyses of protein structure and evolution. For proteins with repeated, shuffled and missing domains, however, traditional multiple sequence alignment algorithms fail to provide an accurate view of homology between related proteins, because they either assume that the input sequences are globally alignable or require locally alignable regions to appear in the same order in all sequences. In this paper, we present ProDA, a novel system for automated detection and alignment of homologous regions in collections of proteins with arbitrary domain architectures. Given an input set of unaligned sequences, ProDA identifies all homologous regions appearing in one or more sequences, and returns a collection of local multiple alignments for these regions. On a subset of the BAliBASE benchmarking suite containing curated alignments of proteins with complicated domain architectures, ProDA performs well in detecting conserved domain boundaries and clustering domain segments, achieving the highest accuracy to date for this task. We conclude that ProDA is a practical tool for automated alignment of protein sequences with repeats and rearrangements in their domain architecture. © 2006 Oxford University Press.

Cite

CITATION STYLE

APA

Phuong, T. M., Do, C. B., Edgar, R. C., & Batzoglou, S. (2006). Multiple alignment of protein sequences with repeats and rearrangements. Nucleic Acids Research, 34(20), 5932–5942. https://doi.org/10.1093/nar/gkl511

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