Sciweavers

686 search results - page 46 / 138
» Inexact pattern matching using genetic algorithm
Sort
View
SODA
1997
ACM
169views Algorithms» more  SODA 1997»
13 years 9 months ago
Partial Matching of Planar Polylines Under Similarity Transformations
Given two planar polylines T and P with n and m edges, respectively, we present an Om2 n2  time, Omn space algorithm to nd portions of the text" T which are similar in sh...
Scott D. Cohen, Leonidas J. Guibas
CSCLP
2007
Springer
14 years 1 months ago
Combining Two Structured Domains for Modeling Various Graph Matching Problems
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
Yves Deville, Grégoire Dooms, Stépha...
PRL
2011
12 years 10 months ago
Structural matching of 2D electrophoresis gels using deformed graphs
2D electrophoresis is a well known method for protein separation which is extremely useful in the field of proteomics. Each spot in the image represents a protein accumulation an...
Alexandre Noma, Alvaro Pardo, Roberto Marcondes Ce...
ICIP
2001
IEEE
14 years 9 months ago
Faster template matching without FFT
We consider the template matching problem, in which one wants to find all good enough occurrences of a pattern template P from a larger image I. The current standard of template m...
Kimmo Fredriksson, Esko Ukkonen
IFIPTCS
2000
13 years 11 months ago
An Index for Two Dimensional String Matching Allowing Rotations
We present an index to search a two-dimensional pattern of size m m in a two-dimensional text of size n n, even when the pattern appears rotated in the text. The index is based on ...
Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen