title: MSARC: Multiple sequence alignment by residue clustering.
abstract: 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.
  
  
  BACKGROUND
  MSARC is available at http://bioputer.mimuw.edu.pl/msarc.
authors.affiliation: Institute of Informatics, University of Warsaw.
authors.forename: Michał
authors.initials: M
authors.lastname: Modzelewski
authors.affiliation: Institute of Informatics, University of Warsaw.
authors.forename: Norbert
authors.initials: N
authors.lastname: Dojer
keywords: Graph partitioning; Multiple sequence alignment; Stochastic alignment
references.citation: Mol Syst Biol. 2011 Oct 11;7:539
references.pmid: 21988835
references.citation: Proteins. 2005 Oct 1;61(1):127-36
references.pmid: 16044462
references.citation: J Mol Biol. 2000 Sep 8;302(1):205-17
references.pmid: 10964570
references.citation: BMC Bioinformatics. 2005 Apr 01;6:83
references.pmid: 15804354
references.citation: PLoS Comput Biol. 2009 May;5(5):e1000392
references.pmid: 19478997
references.citation: Genome Res. 2005 Feb;15(2):330-40
references.pmid: 15687296
references.citation: Science. 2009 Jun 19;324(5934):1561-4
references.pmid: 19541996
references.citation: Nucleic Acids Res. 2010 Aug;38(15):4917-28
references.pmid: 20413579
references.citation: J Comput Biol. 2001;8(3):249-82
references.pmid: 11535176
references.citation: Science. 1992 Jun 5;256(5062):1443-5
references.pmid: 1604319
references.citation: J Mol Biol. 1982 Dec 15;162(3):705-8
references.pmid: 7166760
references.citation: Nucleic Acids Res. 1994 Nov 11;22(22):4673-80
references.pmid: 7984417
references.citation: Bioinformatics. 2006 Nov 15;22(22):2715-21
references.pmid: 16954142
references.citation: Science. 2008 Jun 20;320(5883):1632-5
references.pmid: 18566285
references.citation: Bioinformatics. 2010 Aug 15;26(16):1958-64
references.pmid: 20576627
references.citation: Algorithms Mol Biol. 2008 May 27;3:6
references.pmid: 18505568
references.citation: BMC Bioinformatics. 2005 Mar 22;6:66
references.pmid: 15784139
references.citation: Protein Eng. 1995 Oct;8(10):999-1009
references.pmid: 8771180
references.citation: Science. 2008 Jan 25;319(5862):473-6
references.pmid: 18218900
references.citation: Bioinformatics. 2002;18 Suppl 2:S153-60
references.pmid: 12385998
references.citation: Nucleic Acids Res. 2004 Mar 19;32(5):1792-7
references.pmid: 15034147
references.citation: Syst Biol. 2010 May;59(3):307-21
references.pmid: 20525638
references.citation: Nucleic Acids Res. 2005 Jan 20;33(2):511-8
references.pmid: 15661851
references.citation: Syst Biol. 2005 Jun;54(3):401-18
references.pmid: 16012107