Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Raba...
Abstract. This paper proposes a novel algorithm for complete exact patternmatching focusing the specificities of protein sequences (alphabet of 20 symbols) but, also highly efficie...
This paper addresses the problem of to what extent linear transformation can alleviate nonlinear distortion. We investigate a technique of global affine transformation (GAT) corre...
A successful technique to search large textual databases allowing errors relies on an online search in the vocabulary of the text. To reduce the time of that online search, we ind...
We describe an algorithm for recovering non-local dependencies in syntactic dependency structures. The patternmatching approach proposed by Johnson (2002) for a similar task for p...