穷举精确字符串匹配:全人类基因组分析
Exhaustive Exact String Matching: The Analysis of the Full Human Genome
摘要:
由于许多实际应用,精确的字符串匹配几十年来一直是计算机科学中的基本问题。有些与常见的程序有关,例如在文件和文本编辑器中搜索,或者最近与更高级的问题有关,例如人工智能和生物信息学中的模式检测。已经开发了数十种用于模式匹配的算法和方法,并且存在几种程序设计语言、包、应用程序和在线系统,其可以在生物序列中执行精确的字符串匹配。然而,这些技术仅限于在序列中搜索特定的和预定义的字符串。本文提出了一种新的方法(称为Ex2SM),这是一个先进的数据结构和算法的执行流水线,明确设计的文本挖掘,可以检测到每一个可能的重复字符串在多元生物序列。与文献中的已知算法相比,这里提出的方法是字符串不可知的,即,它不需要一个输入字符串来搜索它,而是它可以检测到每个字符串,存在至少两次,无论其属性,如长度,频率,字母表,重叠等的复杂性的问题解决和所提出的方法的潜力证明与整个人类基因组上进行的实验分析。更具体地,已经检测到长度高达50个字符的所有重复字符串,由于这种长字符串的可能排列的指数数量,使用其他算法几乎不可能实现这一成就。
英文摘要:
Exact string matching has been a fundamental problem in computer science for decades because of many practical applications. Some are related to common procedures, such as searching in files and text editors, or, more recently, to more advanced problems such as pattern detection in Artificial Intelligence and Bioinformatics. Tens of algorithms and methodologies have been developed for pattern matching and several programming languages, packages, applications and online systems exist that can perform exact string matching in biological sequences. These techniques, however, are limited to searching for specific and predefined strings in a sequence. In this paper a novel methodology (called Ex2SM) is presented, which is a pipeline of execution of advanced data structures and algorithms, explicitly designed for text mining, that can detect every possible repeated string in multivariate biological sequences. In contrast to known algorithms in literature, the methodology presented here is string agnostic, i.e., it does not require an input string to search for it, rather it can detect every string that exists at least twice, regardless of its attributes such as length, frequency, alphabet, overlapping etc. The complexity of the problem solved and the potential of the proposed methodology is demonstrated with the experimental analysis performed on the entire human genome. More specifically, all repeated strings with a length of up to 50 characters have been detected, an achievement which is practically impossible using other algorithms due to the exponential number of possible permutations of such long strings.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。