The sequences are transformed to a relative sequence , in which all the segments are normalized by the previous segment . the relative sequences are categorized and indexed by suffix tree , and the result of the suffix tree search is the potential similar subsequences 通过将序列变换为相对序列,实现了对序列中任意位置、任意长度子序列的规范化;为了提高查询效率,将相对序列的特征向量进行离散化分类,并使用后缀树进行索引。
To explain how to use the heuristics information of the problem to construct constraint - based solving algorithm , the general constraint satisfaction solving technology was briefly introduced , then the principles and the applicability of constraint propagation algorithm , tree search algorithm and heuristics repair algorithm for job shop scheduling were summarized 摘要为了说明如何利用启发式信息构造车间调度的约束满足求解算法,首先概述了常规约束满足求解技术,进而介绍了车间调度问题的约束传播算法、树搜索算法和启发式修复算法的构造原理及适用性。