Using median sets for inferring phylogenetic trees | Zendy

Matthias Bernt | Zendy; Daniel Merkle | Zendy; Martin Middendorf | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Using median sets for inferring phylogenetic trees

Author(s) -

Matthias Bernt,

Daniel Merkle,

Martin Middendorf

Publication year - 2007

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/btl300

Subject(s) - phylogenetic tree , median , heuristics , set (abstract data type) , tree (set theory) , heuristic , mathematics , tree rearrangement , algorithm , combinatorics , computer science , statistics , biology , gene , genetics , mathematical optimization , geometry , programming language

Algorithms for phylogenetic tree reconstruction based on gene order data typically repeatedly solve instances of the reversal median problem (RMP) which is to find for three given gene orders a fourth gene order (called median) with a minimal sum of reversal distances. All existing algorithms of this type consider only one median for each RMP instance even when a large number of medians exist. A careful selection of one of the medians might lead to better phylogenetic trees.

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