Abstract
In this paper, we study pattern matching of points under non-uniform distortions. First we give a natural definition for the problem. Next we present a simple polynomial time algorithm for the one-dimensional case of the problem, whereas we prove that it is NP-hard in two (or more) dimensions. Then we present a practical heuristic algorithm for finding a matching between two sets of spots obtained by the two-dimensional gel electrophoresis technique, which is a special but important case of the problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alt, H., Melhorn, K., Wagner, H., Welzl, E.: Congruence, Similarity and Symmetries of Geometric Objects. Discrete and Computational Geometry 3 (1988) 237–256
Appel, R.D., Vargas, J.R., Palagi, P.M., Walther, D., Hochstrasser, D.F.: Melanie II-A Third Generation Software Package for Analysis of Two-dimensional Electrophoresis Images: II. Algorithms. J. Electrophoresis 18 (1997) 2735–2748
Cardoze, D.E., Schulman, L.J.: Pattern Matching for Spatial Point Sets. In: Proc. 39th IEEE Symp. Found. Comput. Sci. (1998) 156–165
Finch, A.M., Wilson, R.C., Hancock, E.R.: Matching Delaunay Graphs. Pattern Recognition 30 (1997) 123–140
Hatada, I. et al.: A Genomic Scanning Method for Higher Order Organisms Using Restriction Sites as Landmarks. Proc. Natl. Acad. Sci. USA. 88 (1991) 9523–9527
Hoffmann, F., Kriegel, K., Wenk, C.: Matching 2D Patterns of Protein Spots. In: Proc. 14th ACM Symp. Computational Geometry (1998) 231–239
Irani, S., Raghavan, P.: Combinatorial and Experimental Results for Randomized Point Matching Algorithms. In: Proc. 12th ACM Symp. Computational Geometry (1996) 68–77
Kanaya, K., Ohyama, A., Akutsu, T., Fujiyama, A.: Development of Web Interface of Image Analysis System DDGEL for 2d Gel Electrophoresis. In: Genome Informatics 1998, Universal Academy Press, Tokyo (1988) 336–337
Kant, G.: Drawing Planar Graphs Using the Canonical Ordering. Algorithmica 16 (1996) 4–32
Lichtenstein, D.: Planar Formulae and Their Use. SIAM J. Computing 11 (1982) 329–343
Ogawa, H.: Labeled Point Pattern Matching by Delaunay Triangulation and Maximal Cliques. Pattern Recognition 19 (1986) 35–40
Takahashi, K., Nakazawa, M., Watanabe, Y., Konagaya, A.: Fully-Automated Spot Recognition and Matching Algorithms for 2-D Gel Electrophoretogram of Genomic DNA. In: Genome Informatics 1998, Universal Academy Press, Tokyo (1988) 161–172
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Akutsu, T., Kanaya, K., Ohyama, A., Fujiyama, A. (1999). Matching of Spots in 2D Electrophoresis Images. Point Matching Under Non-uniform Distortions. In: Crochemore, M., Paterson, M. (eds) Combinatorial Pattern Matching. CPM 1999. Lecture Notes in Computer Science, vol 1645. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48452-3_16
Download citation
DOI: https://doi.org/10.1007/3-540-48452-3_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66278-5
Online ISBN: 978-3-540-48452-3
eBook Packages: Springer Book Archive