更改

添加1字节 、 2020年5月7日 (四) 14:16
第285行: 第285行:  
===ESU (FANMOD)算法及对应的软件===
 
===ESU (FANMOD)算法及对应的软件===
 
The sampling bias of Kashtan ''et al.'' <ref name="kas1" /> provided great impetus for designing better algorithms for the NM discovery problem. Although Kashtan ''et al.'' tried to settle this drawback by means of a weighting scheme, this method imposed an undesired overhead on the running time as well a more complicated implementation. This tool is one of the most useful ones, as it supports visual options and also is an efficient algorithm with respect to time. But, it has a limitation on motif size as it does not allow searching for motifs of size 9 or higher because of the way the tool is implemented.
 
The sampling bias of Kashtan ''et al.'' <ref name="kas1" /> provided great impetus for designing better algorithms for the NM discovery problem. Although Kashtan ''et al.'' tried to settle this drawback by means of a weighting scheme, this method imposed an undesired overhead on the running time as well a more complicated implementation. This tool is one of the most useful ones, as it supports visual options and also is an efficient algorithm with respect to time. But, it has a limitation on motif size as it does not allow searching for motifs of size 9 or higher because of the way the tool is implemented.
 +
 
由于Kashtan等学者发现的『采样偏差』问题为『the NM discovery problem』设计更好的算法提出了更高要求。虽然Kashtan等人尝试用加权法来解决这个弊端,但这个方法在运行上,消耗了过多的运行时间,且实现起来也变得更加复杂。但这个工具还是最好用的工具之一,因为它支持可视化选项,同时也『是个节约时间的算法』。但是,它在所支持的模体的规模大小还是有局限性。由于该工具在具体实施中,不允许搜索规模大小为9或者更大的模体。
 
由于Kashtan等学者发现的『采样偏差』问题为『the NM discovery problem』设计更好的算法提出了更高要求。虽然Kashtan等人尝试用加权法来解决这个弊端,但这个方法在运行上,消耗了过多的运行时间,且实现起来也变得更加复杂。但这个工具还是最好用的工具之一,因为它支持可视化选项,同时也『是个节约时间的算法』。但是,它在所支持的模体的规模大小还是有局限性。由于该工具在具体实施中,不允许搜索规模大小为9或者更大的模体。
  
46

个编辑