This paper discusses the pattern matching problem for points under non-uniform distortions, which arises from the analysis of two-dimensional (2-D) ...
Point matching under non-uniform distortions and protein side chain ...
pubmed.ncbi.nlm.nih.gov › ...
We developed maximum clique-based algorithms for spot matching for two-dimensional gel electrophoresis images, protein structure alignment and protein ...
1 Introduction. Many important computational problems in Bioinformatics are NP-hard. There are two major ap- proaches to cope with these NP-hard problems.
This paper discusses the pattern matching problem for points under non-uniform distortions, which arises from the analysis of two-dimensional (2-D) ...
Point matching under non-uniform distortions | Request PDF
www.researchgate.net › publication › 22...
This paper discusses the pattern matching problem for points under non-uniform distortions, which arises from the analysis of two-dimensional (2-D) ...
A new algorithm is introduced, called T-hashing, which gives the fastest known deterministic 4-distance-approximation algorithm for tolerant-LCP, ...
TL;DR: This paper presents a simple polynomial time algorithm for a special and one-dimensional case of the pattern matching problem for points under ...
Jul 8, 1999 · In this paper, we study pattern matching of points under non-uniform distortions. First we give a natural definition for the problem.
Bibliographic details on Point matching under non-uniform distortions.
We developed maximum clique-based algorithms for spot matching for two-dimensional gel electrophoresis images, protein structure alignment and protein ...