>>> Complexity Seminar のお知らせ <<<

 　日時：９月９日（月），４時〜５時半頃
 　場所：東京工業大学 南３号館 電気情報系会議室

 　題目：Fast Approximate String Matching

   発表：Ricardo Baeza-Yetz
  　     Computer Science Department
   　    Chile University

　 概要：

	We present the fastest known algorithm for finding similar
	pieces of text. We achieve linear time complexity for small
	patterns independently of the maximal number of errors allowed.
	For large patterns we also improve previous algorithms by
	partitioning either the problem of the pattern. We present
	analytical and experimental results. This is joint work with
	Gonzalo Navarro.