Sequence embedding for fast construction of guide trees for multiple sequence alignment.
BACKGROUND
The most widely used multiple sequence alignment methods require sequences to be clustered as an initial step. Most sequence clustering methods require a full distance matrix to be computed between all pairs of sequences. This requires memory and time proportional to N2 for N sequences. When N grows larger than 10,000 or so, this becomes increasingly prohibitive and can form a significant barrier to carrying out very large multiple alignments.


RESULTS
In this paper, we have tested variations on a class of embedding methods that have been designed for clustering large numbers of complex objects where the individual distance calculations are expensive. These methods involve embedding the sequences in a space where the similarities within a set of sequences can be closely approximated without having to compute all pair-wise distances.


CONCLUSIONS
We show how this approach greatly reduces computation time and memory requirements for clustering large numbers of sequences and demonstrate the quality of the clusterings by benchmarking them as guide trees for multiple alignment. Source code is available for download from http://www.clustal.org/mbed.tgz.
Blackshields
Gordon
G
UCD Conway Institute of Biomolecular and Biomedical Sciences, University College Dublin, Dublin 4, Ireland. fabian.sievers@ucd.ie.
Sievers
Fabian
F
Shi
Weifeng
W
Wilm
Andreas
A
Higgins
Desmond G
DG
Bioinformatics. 2007 Nov 1;23(21):2947-8
17846036
Nucleic Acids Res. 2002 Jul 15;30(14):3059-66
12136088
Proteins. 2005 Oct 1;61(1):127-36
16044462
J Mol Biol. 2000 Sep 8;302(1):205-17
10964570
Proteins. 1997 Jul;28(3):405-20
9223186
Comput Biol Chem. 2008 Aug;32(4):282-6
18450519
Mol Biol Evol. 1987 Jul;4(4):406-25
3447015
Genome Res. 2005 Feb;15(2):330-40
15687296
J Mol Evol. 1984;20(2):175-86
6433036
J Mol Biol. 1970 Mar;48(3):443-53
5420325
Protein Sci. 1998 Nov;7(11):2469-71
9828015
Bioinformatics. 2008 Jul 1;24(13):i41-9
18586742
Bioinformatics. 1999 Jan;15(1):87-8
10068696
Nucleic Acids Res. 2006 Jan 1;34(Database issue):D247-51
16381856
J Mol Biol. 1997 May 2;268(2):539-56
9159489
Nucleic Acids Res. 2004 Mar 19;32(5):1792-7
15034147
J Mol Evol. 1987;25(4):351-60
3118049
Bioinformatics. 2007 Apr 1;23(7):802-8
17267437
Comput Appl Biosci. 1987 Jun;3(2):81-7
3453222
Nucleic Acids Res. 2009 Jan;37(Database issue):D141-5
19004872
Bioinformatics. 2007 Feb 1;23(3):372-4
17118958
Nucleic Acids Res. 2005 Jan 1;33(Database issue):D121-4
15608160
Nucleic Acids Res. 1994 Nov 11;22(22):4673-80
7984417
Brief Bioinform. 2008 Jul;9(4):286-98
18372315
Proc Natl Acad Sci U S A. 1983 Feb;80(3):726-30
6572363