几个字符串处理问题的实用数学技巧
Practical Algorithmic Techniques for Several String Processing Problems
摘要：
数据采掘和知识发现领域使用大量的文本数据，这些数据需要被有效地处理。特定的问题，如寻找一组有序集的最大权重有序公共子集或搜索文本中的特定模式，经常发生在这种情况下。在本文中，我们提出了几个新的和实用的算法技术处理文本数据（字符串），以有效地解决多个问题。我们的技术利用有效的字符串算法和数据结构，如KMP，后缀数组，尝试和确定性有限自动机。
英文摘要：
The domains of data mining and knowledge discovery make use of large amounts of textual data, which need to be handled efficiently. Specific problems, like finding the maximum weight ordered common subset of a set of ordered sets or searching for specific patterns within texts, occur frequently in this context. In this paper we present several novel and practical algorithmic techniques for processing textual data (strings) in order to efficiently solve multiple problems. Our techniques make use of efficient string algorithms and data structures, like KMP, suffix arrays, tries and deterministic finite automata.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
