Fast Algorithms for Inferring Evolutionary Trees | Zendy

Richa Agarwala | Zendy; David FernándezBaca | Zendy; Giora Slutzki | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Fast Algorithms for Inferring Evolutionary Trees

Author(s) -

Richa Agarwala,

David FernándezBaca,

Giora Slutzki

Publication year - 1995

Publication title -

journal of computational biology

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.585

H-Index - 95

eISSN - 1557-8666

pISSN - 1066-5277

DOI - 10.1089/cmb.1995.2.397

Subject(s) - algorithm , key (lock) , character (mathematics) , set (abstract data type) , computer science , phylogenetics , binary number , process (computing) , mathematics , biology , biochemistry , arithmetic , gene , programming language , operating system , geometry , computer security

We present algorithms for the perfect phylogeny problem restricted to binary characters. The first algorithm is faster than a previous algorithm by Gusfield when the input matrix for the problem is sparse. Next, we present two online algorithms. For the first of these, the set of species is fixed and the characters are given as input one at a time, while, for the second, the set of characters is fixed and the species are given as input one at a time. These two online algorithms are then combined into an algorithm that can process any sequence of additions and deletions of species and characters.

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