Approximate Pattern Matching in Nanotechnology
Viswanath Annampedu, Meghanad D. Wagh · TechConnect Briefs · 2006
Approximate pattern matching is comparing an unknown pattern with a database of stored patterns with a specied error tolerance. This ability to compensate for real world sensor errors makes approximate pattern matching an ideal choice for a wide range of applications including ngerprin t, picture and bar-code identication, industrial automation, robotics and bioinformatics. This paper shows that a target pattern may be matched with a library of patterns within any specied error tolerance with a single deterministic threshold function. This function for n bit patterns can be implemented in nanotechnology using 2n + 1 unit area RTDs and one RTD of 1.5 times unit area and is congurable for any error tolerance and any given target pattern.