Abstract / Bemerkung
Background During evolution, genomes are modified by large scale structural events, such as rearrangements, deletions or insertions of large blocks of DNA. Of particular interest, in order to better understand how this type of genomic evolution happens, is the reconstruction of ancestral genomes, given a phylogenetic tree with extant genomes at its leaves. One way of solving this problem is to assume a rearrangement model, such as Double Cut and Join (DCJ), and find a set of ancestral genomes that minimizes the number of events on the input tree. Since this problem is NP-hard for most rearrangement models, exact solutions are practical only for small instances, and heuristics have to be used for larger datasets. This type of approach can be called event-based. Another common approach is based on finding conserved structures between the input genomes, such as adjacencies between genes, possibly also assigning weights that indicate a measure of confidence or probability that this particular structure is present on each ancestral genome, and then finding a set of non conflicting adjacencies that optimize some given function, usually trying to maximize total weight and minimizing character changes in the tree. We call this type of methods homology-based. Results In previous work, we proposed an ancestral reconstruction method that combines homology- and event-based ideas, using the concept of intermediate genomes, that arise in DCJ rearrangement scenarios. This method showed better rate of correctly reconstructed adjacencies than other methods, while also being faster, since the use of intermediate genomes greatly reduces the search space. Here, we generalize the intermediate genome concept to genomes with unequal gene content, extending our method to account for gene insertions and deletions of any length. In many of the simulated datasets, our proposed method had better results than MLGO and MGRA, two state-of-the-art algorithms for ancestral reconstruction with unequal gene content, while running much faster, making it more scalable to larger datasets. Conclusion Studing ancestral reconstruction problems under a new light, using the concept of intermediate genomes, allows the design of very fast algorithms by greatly reducing the solution search space, while also giving very good results. The algorithms introduced in this paper were implemented in an open-source software called RINGO (ancestral Reconstruction with INtermediate GenOmes), available at https://github.com/pedrofeijao/RINGO.
Ancestral reconstruction Small parsimony problem Genome rearrangement Double-cut-and-join InDels Gene insertions and deletions
14th Annual Research in Computational Molecular Biology (RECOMB) Comparative Genomics Satellite Workshop
2016-10-11 – 2016-10-11
Feijão P, Soares de Araujo FE. Fast ancestral gene order reconstruction of genomes with unequal gene content. BMC Bioinformatics. 2016;17(S14): 413.
Feijão, P., & Soares de Araujo, F. E. (2016). Fast ancestral gene order reconstruction of genomes with unequal gene content. BMC Bioinformatics, 17(S14), 413. doi:10.1186/s12859-016-1261-9
Feijão, P., and Soares de Araujo, F. E. (2016). Fast ancestral gene order reconstruction of genomes with unequal gene content. BMC Bioinformatics 17:413.
Feijão, P., & Soares de Araujo, F.E., 2016. Fast ancestral gene order reconstruction of genomes with unequal gene content. BMC Bioinformatics, 17(S14): 413.
P. Feijão and F.E. Soares de Araujo, “Fast ancestral gene order reconstruction of genomes with unequal gene content”, BMC Bioinformatics, vol. 17, 2016, : 413.
Feijão, P., Soares de Araujo, F.E.: Fast ancestral gene order reconstruction of genomes with unequal gene content. BMC Bioinformatics. 17, : 413 (2016).
Feijão, Pedro, and Soares de Araujo, Francisco Eloi. “Fast ancestral gene order reconstruction of genomes with unequal gene content”. BMC Bioinformatics 17.S14 (2016): 413.
Alle Dateien verfügbar unter der/den folgenden Lizenz(en):
This Item is protected by copyright and/or related rights. [...]