首页| JavaScript| HTML/CSS| Matlab| PHP| Python| Java| C/C++/VC++| C#| ASP| 其他|
购买积分 购买会员 激活码充值

您现在的位置是:虫虫源码 > 其他 > A program to find frequent molecular (subst ructures and discriminative fragment...

A program to find frequent molecular (subst ructures and discriminative fragment...

  • 资源大小:335.23 kB
  • 上传时间:2021-06-30
  • 下载次数:0次
  • 浏览次数:1次
  • 资源积分:1积分
  • 标      签: 算法 java

资 源 简 介

A program to find frequent molecular substructures and discriminative fragments in a database of molecule descriptions. The algorithm is based on the Eclat algorithm for frequent item set mining.-A program to find frequent molecular (subst ructures and discriminative fragments in a dat abase of molecule descriptions. The algorithm is based on the algorithm for frequent Eclat ite m set mining.

文 件 列 表

moss
Atom.java
bench
Bond.java
data
doc
Embedding.java
Extension.java
Fragment.java
makefile
MaxSrcExt.java
Miner.java
Molecule.java
MoSS.java
Notation.java
RightExt.java
run
SLN.java
SMILES.java
TypeMap.java

相 关 资 源

您 可 能 感 兴 趣 的

同 类 别 推 荐

VIP VIP