Filters








70,284 Hits in 3.8 sec

Parameterized Pattern Matching: Algorithms and Applications

Brenda S. Baker
1996 Journal of computer and system sciences (Print)  
In this paper, we investigate parameterized pattern matching via parameterized suffix trees (p-suffix trees).  ...  We show that using a p-suffix tree for a pattern p-string P, it is possible to search for all p-matches of P within a text p-string T in space linear in |P| and time linear in |T | for fixed alphabets,  ...  Their parameterized multiple pattern matching algorithm finds p-matches to a set of p-string patterns in time O(|T | log _+tocc), with preprocessing time O(d log _).  ... 
doi:10.1006/jcss.1996.0003 fatcat:wep5ws5bb5cdhhizodzgzpdlea

Compressed parameterized pattern matching

Richard Beal, Donald Adjeroh
2016 Theoretical Computer Science  
In this work, we define the compressed parameterized pattern matching (compressed p-matching) problem to find all of the p-matches between a pattern P and text T , using only P and the compressed text  ...  Prior to this work, parameterized pattern matching (p-matching) was defined predominately by the matching between uncompressed parameterized strings (p-strings) from the constant alphabet Σ and the parameter  ...  In applications where we wish to detect similar biological sequences [40, 14] or identify plagiarism [8, 50] between P and T , we can solve the problem with parameterized pattern matching (p-matching  ... 
doi:10.1016/j.tcs.2015.09.015 fatcat:3drdwykatbc4dfuks3kri5bpjm

Compressed Parameterized Pattern Matching

R. Beal, D. A. Adjeroh
2013 2013 Data Compression Conference  
In this work, we define the compressed parameterized pattern matching (compressed p-matching) problem to find all of the p-matches between a pattern P and text T , using only P and the compressed text  ...  Prior to this work, parameterized pattern matching (p-matching) was defined predominately by the matching between uncompressed parameterized strings (p-strings) from the constant alphabet Σ and the parameter  ...  In applications where we wish to detect similar biological sequences [40, 14] or identify plagiarism [8, 50] between P and T , we can solve the problem with parameterized pattern matching (p-matching  ... 
doi:10.1109/dcc.2013.54 dblp:conf/dcc/BealA13 fatcat:qojdw2in2jaurocwgisow4zxve

Parameterized Pattern Matching -- Succinctly [article]

Arnab Ganguly, Rahul Shah, Sharma V. Thankachan
2016 arXiv   pre-print
We consider the Parameterized Pattern Matching problem, where a pattern P matches some location in a text T iff there is a one-to-one correspondence between the alphabet symbols of the pattern to those  ...  A pattern P matches a substring S of T iff the static characters match exactly, and there exists a one-to-one function that renames the parameterized characters in S to that in P.  ...  Previous and Related Work Parameterized pattern matching has seen constant development since its inception by Baker [Bak93] in 1993.  ... 
arXiv:1603.07457v2 fatcat:m7va2tkpbndz3ls7rwjvawmzra

Multiple matching of parameterized patterns

Ramana M. Idury, Alejandro A. Schäffer
1996 Theoretical Computer Science  
We extend Baker's theory of parameterized string matthing (1993) to algorithms that match multiple Patterns in a text.  ...  We first consider the case where the Patterns are fixed and preprocessed once, and then the case where the Pattern set tan Change by insertions and deletions.  ...  Introduction In string matthing applications, we are often given a Pattern and a text, and asked to find the locations in the text at which the Pattern matches the text.  ... 
doi:10.1016/0304-3975(94)00270-3 fatcat:52i63aw26vdbth6mossgxrkebe

A Parameterized Study of Maximum Generalized Pattern Matching Problems [article]

Sebastian Ordyniak, Alexandru Popa
2014 arXiv   pre-print
of the text alphabet, the number of occurrences of a letter in the pattern, the size of the pattern alphabet, the maximum length of a string matched to any pattern letter, the number of wildcards and  ...  The generalized function matching (GFM) problem has been intensively studied starting with [Ehrenfeucht and Rozenberg, 1979].  ...  Introduction In the generalized function matching problem one is given a text t and a pattern p and the goal is to decide whether there is a match between p and t, where a single letter of the pattern  ... 
arXiv:1409.2398v1 fatcat:acpgekqryjfbdfctw3vna3gsb4

Parameterized pattern queries

Cédric du Mouza, Philippe Rigaux, Michel Scholl
2007 Data & Knowledge Engineering  
A parameterized pattern is essentially a string made of constant symbols or variables where variables can be matched against any symbol of the input string.  ...  Parameterized patterns allow a concise and expressive definition of regular expressions that would be very complex to describe without variables.  ...  Our main contribution is an extension of the KMP algorithm [7] to parameterized pattern matching which preserves its linear time complexity and enjoys low space requirements.  ... 
doi:10.1016/j.datak.2007.03.005 fatcat:zxyofhwfrbcl5hamzntti2h5vi

A Parameterized Study of Maximum Generalized Pattern Matching Problems

Sebastian Ordyniak, Alexandru Popa
2015 Algorithmica  
In the same paper it is given a √ OP T approximation algorithm for the optimization variant of GFM where the goal is to search for a pattern p ′ that GF-matches t and has the smallest Hamming distance  ...  If, moreover, the matching is required to be injective, then we term the problem generalized parameterized matching (GPM).  ... 
doi:10.1007/s00453-015-0008-8 fatcat:rod45jeltvadppqr357byug44e

A Parameterized Study of Maximum Generalized Pattern Matching Problems [chapter]

Sebastian Ordyniak, Alexandru Popa
2014 Lecture Notes in Computer Science  
In the same paper it is given a √ OP T approximation algorithm for the optimization variant of GFM where the goal is to search for a pattern p ′ that GF-matches t and has the smallest Hamming distance  ...  If, moreover, the matching is required to be injective, then we term the problem generalized parameterized matching (GPM).  ... 
doi:10.1007/978-3-319-13524-3_23 fatcat:bvissy4f7nck3fcisxpokdvhoa

Function Matching: Algorithms, Applications, and a Lower Bound [chapter]

Amihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, Ely Porat
2003 Lecture Notes in Computer Science  
The function matching problem has as its input a text T of length n over alphabet ΣT and a pattern P = P [1]P [2] · · · P [m] of length m over alphabet ΣP .  ...  We introduce a new matching criterion -function matching -that captures several different applications.  ...  This is done via efficient randomized and deterministic algorithms for two-dimensional parameterized and function matching.  ... 
doi:10.1007/3-540-45061-0_72 fatcat:kx6jrpya3jdalifhx2avotsn2q

Parameterized Algorithms for Matrix Completion with Radius Constraints

Tomohiro Koana, Vincent Froese, Rolf Niedermeier, Oren Weimann, Inge Li Gørtz
2020 Annual Symposium on Combinatorial Pattern Matching  
Hermelin and Rozenberg [CPM 2014, TCS 2016] performed a parameterized complexity analysis for Closest String with Wildcards.  ...  In general, our results indicate that, although being NP-hard as well, this variant often allows for faster (fixed-parameter) algorithms.  ...  Parameterized Algorithms for Matrix Completion with Radius Constraints Algorithm 2 Algorithm for Neighboring String by Gramm et al. [11]. Input: A matrix T ∈ (Σ ∪ { * }) n× and d 1 , . . . , d n ∈ N.  ... 
doi:10.4230/lipics.cpm.2020.20 dblp:conf/cpm/KoanaFN20 fatcat:fp5xg5xtrfgcrpo7kn2oohwhw4

Efficient evaluation of parameterized pattern queries

Cédric du Mouza, Philippe Rigaux, Michel Scholl
2005 Proceedings of the 14th ACM international conference on Information and knowledge management - CIKM '05  
Many applications rely on sequence databases and use extensively pattern-matching queries to retrieve data of interest.  ...  This paper extends the traditional pattern-matching expressions to parameterized patterns, featuring variables.  ...  CONCLUSION This paper proposes an extension of the standard pattern matching KMP algorithm [12] to parameterized patterns.  ... 
doi:10.1145/1099554.1099731 dblp:conf/cikm/MouzaRS05 fatcat:uke3hft4inggpedlkbamr7ic2y

Parameterized principal component analysis

Ajay Gupta, Adrian Barbu
2018 Pattern Recognition  
We introduce a novel manifold approximation method, parameterized principal component analysis (PPCA) that models data with linear subspaces that change continuously according to the extra parameter of  ...  We compared PPCA to PCA, sparse PCA and to independent principal component analysis (IPCA), which groups observations by their parameter values and projects each group using PCA with no sharing of information  ...  We choose a pre-determined number of cycles n c , and terminate the algorithm early if the algorithm is deemed to have converged, based on the energy.  ... 
doi:10.1016/j.patcog.2018.01.018 fatcat:dolyxhljmzeonpar4de7s2io5m

Detecting and Counting Small Patterns in Planar Graphs in Subexponential Parameterized Time [article]

Jesper Nederlof
2019 arXiv   pre-print
For counting problems, it was a repeatedly asked open question whether 2^o(k)n^O(1) time algorithms exist that count even special patterns such as independent sets, matchings and paths in planar graphs  ...  We present an algorithm that takes as input an n-vertex planar graph G and a k-vertex pattern graph P, and computes the number of (induced) copies of P in G in 2^O(k/ k)n^O(1) time.  ...  Moreover, Radu Curticapean pointed out the O * (2 O(k) ) time algorithm from [Dor10] and enriched the author's vocabulary with the verb 'to include-exclude'.  ... 
arXiv:1904.11285v1 fatcat:ca5c5d3e65fltf7vuv7ezr2x7u

Fitting parameterized three-dimensional models to images

D.G. Lowe
1991 IEEE Transactions on Pattern Analysis and Machine Intelligence  
Their application is demonstrated for tracking the motion of curved, parameterized objects.  ...  Model-based recognition and motion tracking depends upon the ability to solve for projection and model parameters that will best fit a 3-D model to matching 2-D image features.  ...  In our matching algorithm, we also take account of potential ambiguities in the match to increase the standard deviation (i.e., reduce the weighting) for matches that exhibit more than one nearby alternative  ... 
doi:10.1109/34.134043 fatcat:ejfgcnyjynbpxi26ftrug5ezze
« Previous Showing results 1 — 15 out of 70,284 results