Inferring horizontal transfers in the presence of rearrangements by the minimum evolution criterion | Zendy

Hadas Birin | Zendy; Zohar Gal-Or | Zendy; Isaac Elias | Zendy; Tamir Tuller | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Inferring horizontal transfers in the presence of rearrangements by the minimum evolution criterion

Author(s) -

Hadas Birin,

Zohar Gal-Or,

Isaac Elias,

Tamir Tuller

Publication year - 2008

Publication title -

bioinformatics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 3.599

H-Index - 390

eISSN - 1367-4811

pISSN - 1367-4803

DOI - 10.1093/bioinformatics/btn024

Subject(s) - phylogenetic tree , genome , set (abstract data type) , computer science , tree (set theory) , code (set theory) , horizontal gene transfer , computational complexity theory , point (geometry) , algorithm , computational biology , theoretical computer science , biology , genetics , gene , mathematics , combinatorics , programming language , geometry

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 materials (HGTS). 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. These facts encourage developing methods for inferring phylogenetic networks that do not require aligned sequences as input.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research