« Bayesian Methods for Improving Credit Scoring Models | Main | Texas economic variables »
January 15, 2005
BLAST and SAS: String matching algorithms and their application
Was the author really Shakespeare?- String matching algorithms and
their application
Raymond Wan
Gilead Sciences, Inc.
Sting matching especially approximate (fuzzy) string matching is
important to a lot of different fields in computer science. It is
used in CRM, database cleaning, bibliometrics, and especially
bioinformatics. In fact, a large portion of the supercomputing
resources in the world is now devoted to an algorithm called BLAST
(Basic Local Alignment Search Tool), which is a fuzzy string matching
algorithm. At the heart of all these applications is the need to
measure how different two text strings are to each other. We will look
at two different ways to build a measure and how it can be
implemented in SAS.
June 2004 Bay Area SAS Users Group Meeting
When: 8 June 2004
Time: 1:00-5:00 p.m.
Where: Gilead Sciences, Inc.
320 Lakeside Drive, Foster City, CA 94404
Map
Host: Steve Wong
steve.wong@gilead.com
Contact/Information:
Glenn Itano (650-522-5671)
Sandy Chang (650-522-5285)
Posted by omor at January 15, 2005 03:21 PM