Pattern Matching with Wildcards and Length Constraints

具有通配符和长度约束的模式匹配

• 批准号: 0514819
• 负责人: Xindong Wu
• 金额: $ 20万
• 依托单位: University of Vermont & State Agricultural College
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2005
• 资助国家: 美国
• 起止时间: 2005-07-15 至 2008-06-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0514819&HistoricalAwards=false
• 关键词: Pattern; Matching; Wildcards; Length; Constraints

ABSTRACT0514819PI: Xindong Wu; Co-PIs: Abdullah N. Arslan and Xingquan ZhuU of Vermont & State Agricultural CollegePattern Matching with Wildcards and Length ConstraintsThis research defines a unique problem of pattern matching with wildcards and length constraints, and aims to design efficient algorithms for the problem. Given a pattern P and a text T, a substring S in T is a matching string of P if (1) the number of wildcards between each two consecutive pattern letters in S and (2)the length of S are both bounded by the user's specifications. The project seeks to find the maximum number of ``distinct'' occurrences of P in T. This is a complex problem that integrates both local constraints(in the form of gaps between consecutive pattern letters) and global length constraints in pattern matching.The research team will start with an existing preliminary design and further investigate the pattern matching problem, by (1) exploring the time complexity of the problem, (2) designing new, efficient algorithms to deal with some special cases, and (3) applying these efficient algorithms in practical problems in text indexing, gene sequence analysis, network security and stream data mining.

Abstract0514819pi：Xindong Wu; Co-Pis：佛蒙特州和州农业大学的Abdullah N. Arslan和Xingquan Zhuu与通配符匹配和长度约束，这定义了与通配符和长度约束的模式匹配的独特问题，并旨在为问题设计有效的算法。 给定图案p和a文本t，如果（1）s中的每两个连续的模式字母之间的通配符和（2）s的长度都受用户的规格界定，则t中的s子字符串s是p的匹配字符串。 The project seeks to find the maximum number of ``distinct'' occurrences of P in T. This is a complex problem that integrates both local constraints(in the form of gaps between consecutive pattern letters) and global length constraints in pattern matching.The research team will start with an existing preliminary design and further investigate the pattern matching problem, by (1) exploring the time complexity of the problem, (2) designing new, efficient algorithms to deal with some special案例和（3）在文本索引，基因序列分析，网络安全和流数据挖掘中应用这些有效算法。