一种新的符号序列长重复容错搜索方法
New Error Tolerant Method to Search Long Repeats in Symbol Sequences
摘要:
提出了一种识别一个或多个符号序列中所有足够长的重复子串的新方法。该方法是基于一个特定的规范应用于符号序列,保证识别的重复子串。它允许子字符串的匹配包含给定级别的错误。该规范是基于一个非常稀疏的字典的重复,从而大大加快了搜索过程的发展。一些基因组应用说明了该方法。本文是第三届计算生物学算法国际会议上演讲的扩展和详细版本,将于2016年6月21日至22日在西班牙特鲁希略举行。
英文摘要:
A new method to identify all sufficiently long repeating substrings in one or several symbol sequences is proposed. The method is based on a specific gauge applied to symbol sequences that guarantees identification of the repeating substrings. It allows the matching of substrings to contain a given level of errors. The gauge is based on the development of a heavily sparse dictionary of repeats, thus drastically accelerating the search procedure. Some genomic applications illustrate the method. This paper is the extended and detailed version of the presentation at the third International Conference on Algorithms for Computational Biology to be held at Trujillo, Spain, June 21-22, 2016.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。