trinity运行原理及常见报错（四）

6.运行butterfly

Butterfly consists of two parts. 分为两步：

第一步：graph simplification
During the first part, called graph simplification, Butterfly iterates between (i) merging consecutive nodes in linear paths in the de Bruijn graph to form nodes that represent longer sequences and (ii) pruning edges that represent minor deviations (supported by comparatively few reads), which likely correspond to sequencing errors. Diploid polymorphisms are expected to be more frequent than sequencing errors and will likely be maintained.
(i)合并在de Bruijn graph中有线性节点的路径，以形成更长的路径
(ii)剔除可能由于测序错误导致的分岔路径，使得路径的边缘平滑均匀，这些分岔路径一般都有极少的reads支持。此外，多倍体多态性比测序错误更为常见，这种情况对分支进行保留。

第二步：plausible path scoring
In the second part, called plausible path scoring, Butterfly identifies those paths that are supported by actual reads and read pairs, using a dynamic programming procedure that traverses potential paths in the graph while maintaining the reads (and pairs) that support them.
用动态规划算法进行打分，鉴定出被reads和read pairs支持的路径，剔除reads支持较少的路径。

--------------------------------------------------------------------------------
------------ Trinity Phase 2: Assembling Clusters of Reads ---------------------
----------------------------------------------------