Inferring models of rearrangements, recombinations, and horizontal transfers by the minimum evolution criterion

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The evolution of viruses is very rapid and in addition to local point mutations (insertion, deletion, substitution) it also includes frequent recombinations, genome rearrangements, and horizontal transfer of genetic material. Evolutionary analysis of viral sequences is therefore a complicated matter for two main reasons: First, due to HGTs and recombinations, the right model of evolution is a network and not a tree. Second, due to genome rearrangements, an alignment of the input sequences is not guaranteed. Since contemporary methods for inferring phylogenetic networks require aligned sequences as input, they cannot deal with viral evolution. In this work we present the first computational approach which deals with both genome rearrangements and horizontal gene transfers and does not require a multiple alignment as input. We formalize a new set of computational problems which involve analyzing such complex models of evolution, investigate their computational complexity, and devise algorithms for solving them. Moreover, we demonstrate the viability of our methods on several synthetic datasets as well as biological datasets. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Birin, H., Gal-Or, Z., Elias, I., & Tuller, T. (2007). Inferring models of rearrangements, recombinations, and horizontal transfers by the minimum evolution criterion. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4645 LNBI, pp. 111–123). Springer Verlag. https://doi.org/10.1007/978-3-540-74126-8_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free