Combinatorial Pattern Matching Conference (CPM); Asilomar Conference Center, Monterey, California; June 5-8,1994

小行星9403663 这笔赠款是为了部分支持将于1994年6月5日至8日在加州蒙特雷的阿西洛马会议中心举行的“组合模式匹配（CPM）"会议。 组合模式匹配解决了字符串和更复杂的模式（如树、正则表达式、扩展表达式）的搜索和匹配问题。 它还解决了发现字符串中的未知模式和从部分模式信息重构字符串等问题。 该领域的目标是获得非平凡的组合性质，这样的结构，然后利用这些属性，以实现相应的计算问题的上级性能。 会议重点关注与组合模式匹配和序列分析相关的所有领域的原创性工作，包括理论和应用。 领域包括但不限于字符串算法、模式识别、分子和进化生物学应用、文本搜索、信息检索、符号计算和数据压缩。 *** v S t Õ K M $ $ $ ( F / V V Õ / 1件 Symbol Arial 5 CNew V " H %N EJ E O D R：\WW20USER\ABSTRACT.DOT Dr. Gusfled abstract 01/31/94 Rowena冈萨雷斯Rowena冈萨雷斯

9403663 Gusfled This grant is for the partial support of the conference on "Combinatorial Pattern Matching (CPM)", to be held at the Asilomar conference center, Monterey California, June 5-8, 1994. Combinatorial pattern Matching addresses issues of searching and matching of strings and more complicated patterns such as trees, regular expressions, extended expressions. It also addresses issues such as the discovery of unknown pattern in strings and the reconstruction of strings from partial pattern information. The goal of the field is to derive nontrivial combinatorial properties for such structures and then to exploit these properties in order to achieve superior performances for the corresponding computational problems. The conference focuses on original work in all areas related to combinatorial pattern matching and sequence analysis, both theoretical and applied. Areas include, but are not limited to, string algorithms, pattern recognition, applications to molecular and evolutionary biology, text searching, information retrieval, symbolic computing and data compression. *** v s t Õ K M $ $ $ ( F / V V Õ / 1 Courier Symbol & Arial 5 Courier New V " h %N EJ E O d R:\WW20USER\ABSTRACT.DOT Dr. Gusfled abstract 01/31/94 Rowena Gonzales Rowena Gonzales