McClelland Jason, Koslicki David
Mathematics Department, Oregon State University, Corvallis, OR, USA.
J Math Biol. 2018 Oct;77(4):935-949. doi: 10.1007/s00285-018-1235-9. Epub 2018 Apr 25.
Both the weighted and unweighted UniFrac distances have been very successfully employed to assess if two communities differ, but do not give any information about how two communities differ. We take advantage of recent observations that the UniFrac metric is equivalent to the so-called earth mover's distance (also known as the Kantorovich-Rubinstein metric) to develop an algorithm that not only computes the UniFrac distance in linear time and space, but also simultaneously finds which operational taxonomic units are responsible for the observed differences between samples. This allows the algorithm, called EMDUniFrac, to determine why given samples are different, not just if they are different, and with no added computational burden. EMDUniFrac can be utilized on any distribution on a tree, and so is particularly suitable to analyzing both operational taxonomic units derived from amplicon sequencing, as well as community profiles resulting from classifying whole genome shotgun metagenomes. The EMDUniFrac source code (written in python) is freely available at: https://github.com/dkoslicki/EMDUniFrac .
加权和非加权的UniFrac距离已被非常成功地用于评估两个群落是否不同,但并未提供有关两个群落如何不同的任何信息。我们利用最近的观察结果,即UniFrac度量等同于所谓的推土机距离(也称为康托罗维奇-鲁宾斯坦度量),来开发一种算法,该算法不仅能在线性时间和空间内计算UniFrac距离,还能同时找出哪些操作分类单元导致了样本间观察到的差异。这使得名为EMDUniFrac的算法能够确定给定样本为何不同,而不仅仅是它们是否不同,且无需增加计算负担。EMDUniFrac可用于树上的任何分布,因此特别适合分析源自扩增子测序的操作分类单元以及全基因组鸟枪法宏基因组分类产生的群落概况。EMDUniFrac的源代码(用Python编写)可在以下网址免费获取:https://github.com/dkoslicki/EMDUniFrac 。