• 如何后缀中删除子串

    How to remove substring from suffix tree?

    youdao

  • 后缀尝试——说白了有什么区别吗?。

    Suffix tree VS Tries - in plain English , what's the difference?

    youdao

  • 该算法分为三个主要步骤建立后缀寻找公共连接公共子串。

    There are three major steps: establish suffix tree, search for common strings and link common strings.

    youdao

  • 给出基于后缀用户浏览频繁路径页面可达概率快速计算方法

    We present a quick method to mine the frequent path and the reachable set and probability of web pages browsed by users based on the suffix tree;

    youdao

  • 因此本文后缀算法应用搜索引擎中,设计了一个类的元搜索引擎系统

    Therefore, this article applies suffix tree algorithm to the meta search engines, and designs a meta search engine systems with a clustering algorithm.

    youdao

  • 后缀一种非常重要数据结构字符串处理相关各种领域里有着非常广泛的应用

    The suffix tree is a very important data structure, which finds a wide variety of applications in many areas related to string processing.

    youdao

  • 本文主要对适用于生物序列数据后缀索引技术生物信息学中的序列比对算法进行了分析研究。

    This thesis mainly focuses on the study of suffix tree index technical dealing with bio-sequences and multiple sequences alignment problem in bioinformatics.

    youdao

  • 为此,我们引入过程蓝图改进方法降低程序空间复杂度避免源代码变换为后缀这一复杂过程。

    In order to reduce the space complexity of the arithmetic and avoid transforming the source code top-suffix tree, the method is improved based-on process blueprint.

    youdao

  • 分析后缀后缀数组字符串匹配算法基础上,详细阐述了基于后缀数组的精确串联重复序列识别方法

    It addresses the method of identifying the accurate tandem repeat in detail after analyzing suffix tree and suffix array algorithms of string matching.

    youdao

  • 算法建立后缀后缀利用后缀链可以快速定位后缀结点的优势线性时间完成后缀树建立;

    The algorithm is based on suffix-tree with suffix link, make full use of the character of suffix link, rapidly position the next suffix internal node, to accomplish the suffix tree in linear time;

    youdao

  • 其次,提出导航路径利用构造复合后缀方法挖掘用户关键路径利用关键路径用户不同兴趣

    Second, general suffix tree algorithm is used to mine the key path from user's all navigation paths, and using key path to cluster all users into different interest groups.

    youdao

  • 部分后缀基础提出后缀树并行算法,解决了后缀树在应用上的内存瓶颈问题,因此适合大规模序列分析

    Then based on partial suffix tree, presents a new parallel algorithm of suffix tree, which can construction large suffix tree in memory and more perfect to very large sequences.

    youdao

  • 创建aixdn(后缀),AIX用户存储于其中

    Creates the AIX tree DN (suffix) under which AIX user and group is stored.

    youdao

  • 可以认为这个后缀存储Kerberos数据

    Consider the suffix as the root of the inverted tree under which the Kerberos data is stored.

    youdao

  • 因此确保用户cn=ldapbind,o=ibm,c=us 有权读取搜索具有 o=ibm,c=us后缀LDAP目录

    Therefore, ensure that the user cn=ldapbind,o=ibm,c=us has access to read and search the LDAP Directory Tree with the suffix o=ibm,c=us.

    youdao

  • 通过图灵机状态跳转函数思索状态构造得到对于任意状态节点的最大后缀状态,从而大大地加快识别器的识别效率。

    And it also gets the longest suffix state in state tree derived through the constructing of the state-jump function and effectively speeds up the character matching.

    youdao

  • 通过图灵机状态跳转函数思索状态构造得到对于任意状态节点的最大后缀状态,从而大大地加快识别器的识别效率。

    And it also gets the longest suffix state in state tree derived through the constructing of the state-jump function and effectively speeds up the character matching.

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定