Palindrome Detection Using On-line Position
The purpose of this study is to detect a reverse substring in any position i of the string y, uRru is a factor of y, uR is a reverse substring of u and r is a substring between uR and u. We develop an efficient algorithm to detect all reverse repetitions in a string and describe the algorithm for computing the Longest Previous reverse Factor (LPrF) table by using the on-line construction of position heap data structure. This algorithm runs in linear time on a fixed size alphabet. For the applications in bioinformatics field, LPrF table can use to detect palindrome and gapped palindrome.
In this paper, we have presented an effective yield improvement methodology that can help both manufacturing ::: foundries, fabless and fab-lite companies to identify systematic failures. It uses the physical addresses of failing bits ::: from wafer sort results to overlay to inline wafer defect inspection locations. The inline defect patterns or the design ::: patterns where overlay results showed matches were extracted and grouped by feature similarity or cell names. The potentially problematic design patterns can be obtained and used for design debug and process improvement.