Filters








76,847 Hits in 4.0 sec

Pattern Matching with Swaps

Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein
2000 Journal of Algorithms  
The pattern matching with swaps problem is that of finding all locations i for which there exists a swapped version T of T with an exact matching of P in location i of T .  ...  It has been an open problem whether swapped matching can be done in less than O nm time. In this paper we show the first algorithm that solves the pattern matching with swaps problem in time o nm .  ...  ACKNOWLEDGMENTS The authors kindly thank Alex Schäffer for sharing with us the biological inspiration and Ref. [19] .  ... 
doi:10.1006/jagm.2000.1120 fatcat:j4jtr3yp35gobnq232duw575v4

On Pattern Matching With Swaps

Fouad B. Chedid
2013 2013 ACS International Conference on Computer Systems and Applications (AICCSA)  
Pattern Matching with Swaps (PMS for short) is a variation of the classical pattern matching problem where a match is allowed to include disjoint local swaps.  ...  The Pattern Matching with Swaps problem (PMS for short) is a variation of PM in which a match is allowed to include disjoint local swaps.  ...  Thus, the pattern P has a swapped match with T at location j if and only if S j m−1 = 1.  ... 
doi:10.1109/aiccsa.2013.6616414 dblp:conf/aiccsa/Chedid13 fatcat:dr76s3jrtzfj5p2at2cfefbuly

PATTERN MATCHING WITH SWAPS IN PRACTICE

MATTEO CAMPANELLI, DOMENICO CANTONE, SIMONE FARO, EMANUELE GIAQUINTA
2012 International Journal of Foundations of Computer Science  
In the Approximate Pattern Matching problem with Swaps one seeks, for every text location with a swapped match of P , the number of swaps necessary to obtain a match at the location.  ...  The Pattern Matching problem with Swaps consists in finding all occurrences of a pattern P in a text T , when disjoint local swaps in the pattern are allowed.  ...  Introduction The Pattern Matching problem with Swaps (Swap Matching problem, for short) is a well-studied variant of the classic Pattern Matching problem.  ... 
doi:10.1142/s0129054112400151 fatcat:xf44pthurzeopmxq34zyfcdxby

Efficient special cases of pattern matching with swaps [chapter]

Amihood Amir, Gad M. Landau, Moshe Lewenstein, Noa Lewensteint
1998 Lecture Notes in Computer Science  
Key Words: Design and analysis of algorithms, combinatorial algorithms on words, pattern matching, pattern matching with swaps, approximate pattern matching, generalized pattern matching.  ...  We show that for such patterns the pattern matching with swaps problem can be solved in time O(n log 2 m).  ...  Mark each pattern location in which begins with 1 and every other pattern location with . Now simply do pattern matching with don't cares.  ... 
doi:10.1007/bfb0030791 fatcat:6dodrpos3rhojhiocytoelwx54

A New Algorithm for Efficient Pattern Matching with Swaps [chapter]

Matteo Campanelli, Domenico Cantone, Simone Faro
2009 Lecture Notes in Computer Science  
The Pattern Matching problem with Swaps consists in finding all occurrences of a pattern P in a text T , when disjoint local swaps in the pattern are allowed.  ...  Key words: pattern matching with swaps, nonstandard pattern matching, combinatorial algorithms on words, design and analysis of algorithms.  ...  Definition 3 (Pattern Matching Problem with Swaps).  ... 
doi:10.1007/978-3-642-10217-2_24 fatcat:vxgonvgt6bczpjpdjfufw5ahii

Pattern matching with swaps

A. Amir, Y. Aumann, G.M. Landau, M. Lewenstein, N. Lewenstein
Proceedings 38th Annual Symposium on Foundations of Computer Science  
The pattern matching with swaps problem is that of finding all locations i for which there exists a swapped version T of T with an exact matching of P in location i of T .  ...  It has been an open problem whether swapped matching can be done in less than O nm time. In this paper we show the first algorithm that solves the pattern matching with swaps problem in time o nm .  ...  ACKNOWLEDGMENTS The authors kindly thank Alex Schäffer for sharing with us the biological inspiration and Ref. [19] .  ... 
doi:10.1109/sfcs.1997.646103 dblp:conf/focs/AmirALLL97 fatcat:bhnpza5p7zhgjkpvdmiva4ktb4

Approximate Swapped Matching [chapter]

Amihood Amir, Moshe Lewenstein, Ely Porat
2000 Lecture Notes in Computer Science  
However, the Approximate Pattern Matching with Swaps problem was not known to be solved faster than the pattern matching with mismatches problem.  ...  Key Words: Design and analysis of algorithms, combinatorial algorithms on words, pattern matching, pattern matching with swaps, non-standard pattern matching, approximate pattern matching.  ...  Introduction The Pattern Matching with Swaps problem (the Swap Matching problem, for short) requires nding all occurrences of a pattern of length m in a text of length n.  ... 
doi:10.1007/3-540-44450-5_24 fatcat:7mlgsdr5dbai3b27e5mrd5ko3q

String matching with up to k swaps and mismatches

Ohad Lipsky, Benny Porat, Ely Porat, B. Riva Shalom, Asaf Tzur
2010 Information and Computation  
Yet, the problem of string matching with at most k swaps and mismatches errors was open.  ...  Previous work The SMkSM (string matching with up to k swaps and mismatches) problem sets challenges of both approximate matching and that of integrating the swap and mismatch operations.  ... 
doi:10.1016/j.ic.2010.04.001 fatcat:yb4szm27vfg4td5y27zwhpwemm

Page 2080 of Mathematical Reviews Vol. , Issue 2003C [page]

2003 Mathematical Reviews  
However, the approximate pattern matching with swaps problem was not known to be solved faster than the pattern matching with mismatches problem.  ...  Consequently, the total time for solving the approximate pattern matching with swaps problem is O(f (n,m) +nlogmloga), where f (n,m) is the time necessary for solving the pattern matching with swaps problem  ... 

A Simple Streaming Bit-parallel Algorithm for Swap Pattern Matching [article]

Václav Blažej, Ondřej Suchý, Tomáš Valla
2018 arXiv   pre-print
The pattern matching problem with swaps is to find all occurrences of a pattern in a text while allowing the pattern to swap adjacent symbols.  ...  The goal is to design fast matching algorithm that takes advantage of the bit parallelism of bitwise machine instructions and has only streaming access to the input.  ...  Introduction In the Pattern Matching problem with Swaps (Swap Matching, for short), the goal is to find all occurrences of any swapped version of a pattern P in a text T , where P and T are strings of  ... 
arXiv:1606.04763v3 fatcat:hekwswzoczerbdpey6cgy2wfhe

Overlap matching

Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat
2003 Information and Computation  
Our reduction provides a solution to the pattern matching with swaps problem in time Oðn log m log rÞ.  ...  The string matching with swaps problem is the problem of string matching in the presence of local swaps.  ...  The pattern matching with swaps problem (the swap matching problem, for short), defined by Muthukrishnan [22] , requires finding all occurrences of a pattern of length m in a text of length n.  ... 
doi:10.1016/s0890-5401(02)00035-4 fatcat:t3gxwluq2ve5zlr4eoq3fo25n4

The Swap Matching Problem Revisited [article]

Pritom Ahmed, Costas S. Iliopoulos, A.S.M. Sohidull Islam, M. Sohel Rahman
2013 arXiv   pre-print
In this paper, we revisit the much studied problem of Pattern Matching with Swaps (Swap Matching problem, for short).  ...  Then, using the model, we devise two efficient algorithms to solve the swap matching problem. The resulting algorithms are adaptations of the classic shift-and algorithm.  ...  In this paper, we revisit the Pattern Matching with Swaps problem (the Swap Matching problem, for short), which is a well-studied variant of the classic pattern matching problem.  ... 
arXiv:1309.1981v2 fatcat:xqttwdc3tnc73apa5yc37y4qjy

Space Lower Bounds for Online Pattern Matching [article]

Raphael Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
2011 arXiv   pre-print
In the former case which includes, as an example, pattern matching with character classes, we give Omega(m) bit space lower bounds.  ...  We present space lower bounds for online pattern matching under a number of different distance measures.  ...  pattern matching with character classes [8] requires linear space.  ... 
arXiv:1106.4412v1 fatcat:rfiitmtbfba2pccq53huc3md6y

Space Lower Bounds for Online Pattern Matching [chapter]

Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
2011 Lecture Notes in Computer Science  
In the former case which includes, as an example, pattern matching with character classes, we give Ω(m) bit space lower bounds.  ...  We present space lower bounds for online pattern matching under a number of different distance measures.  ...  On the topic of swap matching in Section 9, we note that in [1] , the existence of a reduction for time rather than space, from Boolean convolutions to string matching with swaps is claimed without proof  ... 
doi:10.1007/978-3-642-21458-5_17 fatcat:obhotgwuandzzkywnsy7a4vtli

Space lower bounds for online pattern matching

Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
2013 Theoretical Computer Science  
In the former case which includes, as an example, pattern matching with character classes, we give Ω(m) bit space lower bounds.  ...  We present space lower bounds for online pattern matching under a number of different distance measures.  ...  On the topic of swap matching in Section 9, we note that in [1] , the existence of a reduction for time rather than space, from Boolean convolutions to string matching with swaps is claimed without proof  ... 
doi:10.1016/j.tcs.2012.06.012 fatcat:vihdt22zwjfvfhr2ljhhuae2wa
« Previous Showing results 1 — 15 out of 76,847 results