Cargando…

CSA: An efficient algorithm to improve circular DNA multiple alignment

BACKGROUND: The comparison of homologous sequences from different species is an essential approach to reconstruct the evolutionary history of species and of the genes they harbour in their genomes. Several complete mitochondrial and nuclear genomes are now available, increasing the importance of usi...

Descripción completa

Detalles Bibliográficos
Autores principales: Fernandes, Francisco, Pereira, Luísa, Freitas, Ana T
Formato: Texto
Lenguaje:English
Publicado: BioMed Central 2009
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2722656/
https://www.ncbi.nlm.nih.gov/pubmed/19627599
http://dx.doi.org/10.1186/1471-2105-10-230
_version_ 1782170322351423488
author Fernandes, Francisco
Pereira, Luísa
Freitas, Ana T
author_facet Fernandes, Francisco
Pereira, Luísa
Freitas, Ana T
author_sort Fernandes, Francisco
collection PubMed
description BACKGROUND: The comparison of homologous sequences from different species is an essential approach to reconstruct the evolutionary history of species and of the genes they harbour in their genomes. Several complete mitochondrial and nuclear genomes are now available, increasing the importance of using multiple sequence alignment algorithms in comparative genomics. MtDNA has long been used in phylogenetic analysis and errors in the alignments can lead to errors in the interpretation of evolutionary information. Although a large number of multiple sequence alignment algorithms have been proposed to date, they all deal with linear DNA and cannot handle directly circular DNA. Researchers interested in aligning circular DNA sequences must first rotate them to the "right" place using an essentially manual process, before they can use multiple sequence alignment tools. RESULTS: In this paper we propose an efficient algorithm that identifies the most interesting region to cut circular genomes in order to improve phylogenetic analysis when using standard multiple sequence alignment algorithms. This algorithm identifies the largest chain of non-repeated longest subsequences common to a set of circular mitochondrial DNA sequences. All the sequences are then rotated and made linear for multiple alignment purposes. To evaluate the effectiveness of this new tool, three different sets of mitochondrial DNA sequences were considered. Other tests considering randomly rotated sequences were also performed. The software package Arlequin was used to evaluate the standard genetic measures of the alignments obtained with and without the use of the CSA algorithm with two well known multiple alignment algorithms, the CLUSTALW and the MAVID tools, and also the visualization tool SinicView. CONCLUSION: The results show that a circularization and rotation pre-processing step significantly improves the efficiency of public available multiple sequence alignment algorithms when used in the alignment of circular DNA sequences. The resulting alignments lead to more realistic phylogenetic comparisons between species.
format Text
id pubmed-2722656
institution National Center for Biotechnology Information
language English
publishDate 2009
publisher BioMed Central
record_format MEDLINE/PubMed
spelling pubmed-27226562009-08-07 CSA: An efficient algorithm to improve circular DNA multiple alignment Fernandes, Francisco Pereira, Luísa Freitas, Ana T BMC Bioinformatics Software BACKGROUND: The comparison of homologous sequences from different species is an essential approach to reconstruct the evolutionary history of species and of the genes they harbour in their genomes. Several complete mitochondrial and nuclear genomes are now available, increasing the importance of using multiple sequence alignment algorithms in comparative genomics. MtDNA has long been used in phylogenetic analysis and errors in the alignments can lead to errors in the interpretation of evolutionary information. Although a large number of multiple sequence alignment algorithms have been proposed to date, they all deal with linear DNA and cannot handle directly circular DNA. Researchers interested in aligning circular DNA sequences must first rotate them to the "right" place using an essentially manual process, before they can use multiple sequence alignment tools. RESULTS: In this paper we propose an efficient algorithm that identifies the most interesting region to cut circular genomes in order to improve phylogenetic analysis when using standard multiple sequence alignment algorithms. This algorithm identifies the largest chain of non-repeated longest subsequences common to a set of circular mitochondrial DNA sequences. All the sequences are then rotated and made linear for multiple alignment purposes. To evaluate the effectiveness of this new tool, three different sets of mitochondrial DNA sequences were considered. Other tests considering randomly rotated sequences were also performed. The software package Arlequin was used to evaluate the standard genetic measures of the alignments obtained with and without the use of the CSA algorithm with two well known multiple alignment algorithms, the CLUSTALW and the MAVID tools, and also the visualization tool SinicView. CONCLUSION: The results show that a circularization and rotation pre-processing step significantly improves the efficiency of public available multiple sequence alignment algorithms when used in the alignment of circular DNA sequences. The resulting alignments lead to more realistic phylogenetic comparisons between species. BioMed Central 2009-07-23 /pmc/articles/PMC2722656/ /pubmed/19627599 http://dx.doi.org/10.1186/1471-2105-10-230 Text en Copyright © 2009 Fernandes et al; 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 Software
Fernandes, Francisco
Pereira, Luísa
Freitas, Ana T
CSA: An efficient algorithm to improve circular DNA multiple alignment
title CSA: An efficient algorithm to improve circular DNA multiple alignment
title_full CSA: An efficient algorithm to improve circular DNA multiple alignment
title_fullStr CSA: An efficient algorithm to improve circular DNA multiple alignment
title_full_unstemmed CSA: An efficient algorithm to improve circular DNA multiple alignment
title_short CSA: An efficient algorithm to improve circular DNA multiple alignment
title_sort csa: an efficient algorithm to improve circular dna multiple alignment
topic Software
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2722656/
https://www.ncbi.nlm.nih.gov/pubmed/19627599
http://dx.doi.org/10.1186/1471-2105-10-230
work_keys_str_mv AT fernandesfrancisco csaanefficientalgorithmtoimprovecirculardnamultiplealignment
AT pereiraluisa csaanefficientalgorithmtoimprovecirculardnamultiplealignment
AT freitasanat csaanefficientalgorithmtoimprovecirculardnamultiplealignment