Genome Institute of Singapore, 60 Biopolis Street, #02-01, Genome, Singapore 138672.
Bioinformatics. 2010 Feb 1;26(3):408-10. doi: 10.1093/bioinformatics/btp689. Epub 2009 Dec 18.
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.
webMGR can be accessed via http://www.gis.a-star.edu.sg/~bourque. The source code of the improved standalone version of MGR is also freely available from the web site.
Supplementary data are available at Bioinformatics online.
算法 MGR 能够基于多个基因组中的基因或同线性块顺序来重建重排系统发育。尽管 MGR 已经成功地应用于研究不同物种集的进化,但由于某些应用程序的运行时间过长,其使用受到了阻碍。在当前的工作中,我们设计了新的启发式算法,在不影响准确性的情况下显著加快了工具的速度。此外,我们还开发了一个网络服务器(webMGR),其中包括精心设计的网络输出,以方便浏览结果。
可以通过 http://www.gis.a-star.edu.sg/~bourque 访问 webMGR。MGR 改进的独立版本的源代码也可以从该网站免费获得。
补充数据可在“Bioinformatics”在线获取。