The RW algorithm has been proposed recently to solve the exact graph matching problem. This algorithm exploits Random Walk theory to compute a topological signature which can be u...
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...
Process variations have become a serious concern for nanometer technologies. The interconnect and device variations include interand intra-die variations of geometries, as well as...
Xiaoning Qi, Alex Gyure, Yansheng Luo, Sam C. Lo, ...
Background: Computational methods to predict transcription factor binding sites (TFBS) based on exhaustive algorithms are guaranteed to find the best patterns but are often limite...
We propose a new method for matching two 3D point sets of identical cardinality with global similarity but local non-rigid deformations and distribution errors. This problem arises...