目的：对比目前热点植物DNA条形码候选序列，试图筛选出植物界的通用条形码序列。
Objective:To find a universal DNA barcode sequence for plant species comparing with the candidate plant barcode sequences.
并在此基础上提出了基于栈结构的支持度计算算法，该算法仅对数据库进行一次扫描，即可实现候选序列的计数操作。
Then it presents a support computing algorithm based on stack structure, which can count the candidate sequences by scanning the database only once.
OV - 4由自由形式的图表示，在该图中，组织要素可能作为OV - 6 c序列图中运作节点的实例的候选。
The OV-4 is represented by a freeform diagram in which organizational elements may be candidates for the instantiation of operational nodes in the OV-6c sequence diagrams.
针对多元时间序列的相似性查询问题，给出参数重要度的定义，提出一种基于参数重要度的候选集查询方法。
Aiming at the problem of multivariate time series similarity search, this paper presents the definition of parameter importance degree and puts forward a candidate sets obtaining method based on it.
方法利用表达序列标签克隆策略选择了1个可能与遗传性骨性反颌畸形相关的候选基因——OT X1。
Methods a candidate gene associated with hereditary bone crossbite deformity-OTX1 was chosen by expressed sequence tags cloning strategy.
根据专家经验由假设建立一个候选集，每个候选故障的行为都是由与状态相关的瞬态分布征兆序列描述的。
A candidate set is set up with hypothesis according to experts experience, and the behaviors for each candidate fault are described by the temporally distributed symptoms relevant to the state.
通过对红外序列图像进行中值滤波、边缘提取、海天线检测和形态滤波等预处理，提取出若干个候选目标。
It firstly extracts several target candidates through the preprocessing including median filtering, edge extraction, sea-sky line detection and morphological filtering of infrared sequence images.
然后他们研究已知的其他味觉接收器的基因序列，发现了第一个候选者——名叫PKD2L1的单一蛋白质。
They then looked for gene patterns known to exist in other taste receptors, leaving a single protein called PKD2L1 as a prime candidate.
如何确定候选频繁序列模式以及如何计算它们的支持数是序列模式挖掘中的两个关键问题。
How to generate candidate frequent sequential pattern and calculate its support is a key problem in mining frequent sequential patterns.
分析欧洲序列密码候选算法ABC的安全性，提炼出两类与安全性密切相关的具有概率优势的线性表达式。
The paper proves the probability advantages of two linear expressions which are summarized from the ABC stream cipher submitted to ECRPYT Estream Project.
该算法考虑了项目集与序列之间的关系，利用时序连接法，采用不同的构造法，构造出相对应的候选集，从而计算出频繁集。
In the algorithm the items and the sequence are discussed respectively, and the time join method is used to introduce the candidate sets, so the frequent sets can be gotten.
该算法考虑了项目集与序列之间的关系，利用时序连接法，采用不同的构造法，构造出相对应的候选集，从而计算出频繁集。
In the algorithm the items and the sequence are discussed respectively, and the time join method is used to introduce the candidate sets, so the frequent sets can be gotten.
应用推荐