Cargando…

MSARC: Multiple sequence alignment by residue clustering

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 align...

Descripción completa

Detalles Bibliográficos
Autores principales: Modzelewski, Michał, Dojer, Norbert
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2014
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4036715/
https://www.ncbi.nlm.nih.gov/pubmed/24735785
http://dx.doi.org/10.1186/1748-7188-9-12
_version_ 1782318190339031040
author Modzelewski, Michał
Dojer, Norbert
author_facet Modzelewski, Michał
Dojer, Norbert
author_sort Modzelewski, Michał
collection PubMed
description 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 http://bioputer.mimuw.edu.pl/msarc
format Online
Article
Text
id pubmed-4036715
institution National Center for Biotechnology Information
language English
publishDate 2014
publisher BioMed Central
record_format MEDLINE/PubMed
spelling pubmed-40367152014-06-11 MSARC: Multiple sequence alignment by residue clustering Modzelewski, Michał Dojer, Norbert Algorithms Mol Biol Research 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 http://bioputer.mimuw.edu.pl/msarc BioMed Central 2014-04-16 /pmc/articles/PMC4036715/ /pubmed/24735785 http://dx.doi.org/10.1186/1748-7188-9-12 Text en Copyright © 2014 Modzelewski and Dojer; licensee BioMed Central Ltd. http://creativecommons.org/licenses/by/2.0 This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
spellingShingle Research
Modzelewski, Michał
Dojer, Norbert
MSARC: Multiple sequence alignment by residue clustering
title MSARC: Multiple sequence alignment by residue clustering
title_full MSARC: Multiple sequence alignment by residue clustering
title_fullStr MSARC: Multiple sequence alignment by residue clustering
title_full_unstemmed MSARC: Multiple sequence alignment by residue clustering
title_short MSARC: Multiple sequence alignment by residue clustering
title_sort msarc: multiple sequence alignment by residue clustering
topic Research
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4036715/
https://www.ncbi.nlm.nih.gov/pubmed/24735785
http://dx.doi.org/10.1186/1748-7188-9-12
work_keys_str_mv AT modzelewskimichał msarcmultiplesequencealignmentbyresidueclustering
AT dojernorbert msarcmultiplesequencealignmentbyresidueclustering