The genealogical sorting index ( gsi ) is a statistic to quantify the common ancestry of labeled tips on a tree.
是用于量化世系树中被标记出的末梢的共有祖先的统计资料。
In this paper, labeled ordered tree is used as the data model of semi structured data, the problem of maximum tree structured frequent pattern mining from semi structured data is studied.
本文以标记有序树作为半结构化数据的数据模型，研究了半结构化数据的树状最大频繁模式挖掘问题。
It is a finite, labeled, directed tree in which the internal nodes are labeled by operators, and the leaf nodes represent the operands of the node operators.
这是一个有限、已标记、导向的树状结构，其中的内部节点会标示运算子，而分叶节点则代表节点运算子的运算元。
The minimum labeling spanning tree(MLST) problem is an NP-hard problem in which, given a graph with labeled edges, one seeks a spanning tree with the least number of labels.
最小标记生成树就是其中之一，它的目标是给出一个边上带有颜色的图，计算使用颜色种类最少的生成树。
The minimum labeling spanning tree(MLST) problem is an NP-hard problem in which, given a graph with labeled edges, one seeks a spanning tree with the least number of labels.
最小标记生成树就是其中之一，它的目标是给出一个边上带有颜色的图，计算使用颜色种类最少的生成树。
应用推荐