webMGR: an online tool for the multiple genome rearrangement problem | Zendy

Chi Ho Lin | Zendy; Hao Zhao | Zendy; Sean Harry Lowcay | Zendy; Atif Shahab | Zendy; Guillaume Bourque | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

webMGR: an online tool for the multiple genome rearrangement problem

Author(s) -

Chi Ho Lin,

Hao Zhao,

Sean Harry Lowcay,

Atif Shahab,

Guillaume Bourque

Publication year - 2009

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

Subject(s) - computer science , genome , gene rearrangement , computational biology , theoretical computer science , biology , genetics , gene

The algorithm MGR enables the reconstruction of rearrangement phylogenies based on gene or synteny block order in multiple genomes. Although MGR has been successfully applied to study the evolution of different sets of species, its utilization has been hampered by the prohibitive running time for some applications. In the current work, we have designed new heuristics that significantly speed up the tool without compromising its accuracy. Moreover, we have developed a web server (webMGR) that includes elaborate web output to facilitate navigation through the results.

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