Filters








64,200 Hits in 3.8 sec

Matching for Run-Length Encoded Strings

Alberto Apostolico, Gad M Landau, Steven Skiena
1999 Journal of Complexity  
For example, the string aaaabbbbcccabbbbcc can be encoded as a4b4c3alb4c2. Such a run-length encoded string can be significantly shorter than the expanded string representation.  ...  Here, we develop significantly faster algorithms for a special class of strings which emerge frequently in pattern matching problems. 1\ string is run-length encollcr!  ...  This problem of Tn<Ltching of run-length encoded strings is a TlcLLural generalization of the Ol"iginal sLring matching problem.  ... 
doi:10.1006/jcom.1998.0493 fatcat:jlbemlm27nfotbtgwfcjzxy7hy

Matching for run-length encoded strings

A. Apostolico, G.M. Landau, S. Skiena
Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171)  
For example, the string aaaabbbbcccabbbbcc can be encoded as a4b4c3alb4c2. Such a run-length encoded string can be significantly shorter than the expanded string representation.  ...  Here, we develop significantly faster algorithms for a special class of strings which emerge frequently in pattern matching problems. 1\ string is run-length encollcr!  ...  This problem of Tn<Ltching of run-length encoded strings is a TlcLLural generalization of the Ol"iginal sLring matching problem.  ... 
doi:10.1109/sequen.1997.666929 dblp:conf/sequences/ApostolicoLS97 fatcat:xtkzuygugje7tdl6pvdkie5byq

Burrows Wheeler Transform Based Test Vector Compression for Digital Circuits

Anju Asokan, J. P. Anita
2016 Indian Journal of Science and Technology  
Methods/Statistical Analysis: In the proposed approach, a hybrid test pattern compression technique is used along with different schemes such as Huffman and Run length encoding.  ...  These encoding schemes are applied on ISCAS'85 and ISCAS'89 benchmark circuits and the results are compared and analyzed based on their compression ratio.  ...  The Table 4 gives results for the same procedure followed but using Run length encoding instead of Huffman coding.  ... 
doi:10.17485/ijst/2016/v9i30/85750 fatcat:hmzmqyzxfzhnlml7x5qagyrqoe

Efficient Deterministic Single Round Document Exchange for Edit Distance [article]

Djamal Belazzougui
2015 arXiv   pre-print
Suppose that the length of the first string (document) is n and that the two strings (documents) have edit distance (minimal number of deletes, inserts and substitutions needed to transform one string  ...  In this paper we show an efficient deterministic protocol for this problem. The protocol runs in time O(n·polylog(n)) and has message size O(k^2+k^2n) bits.  ...  The author wishes to thank Hossein Jowhari and Qin Zhang for the initial fruitful discussions that motivated the problem.  ... 
arXiv:1511.09229v2 fatcat:hfht6fxyfja6bjgnlfeyu37yje

Fast Multiple Pattern Cartesian Tree Matching [article]

Geonmo Gu, Siwoo Song, Simone Faro, Thierry Lecroq, Kunsoo Park
2019 arXiv   pre-print
In this paper, we deal with Cartesian tree matching for the case of multiple patterns. We present two fingerprinting methods, i.e., the parent-distance encoding and the binary encoding.  ...  Our solutions run faster than the previous algorithm as the pattern lengths increase. Especially, our algorithm based on Wu-Manber runs up to 33 times faster.  ...  Both tables use a fingerprint of length-b string, called a block. Either the parent-distance encoding or the binary encoding is used to compute the fingerprint.  ... 
arXiv:1911.01644v1 fatcat:rmygw6wbbfcljfy4qroszcq5va

Compactly encoding unstructured inputs with differential compression

Miklos Ajtai, Randal Burns, Ronald Fagin, Darrell D. E. Long, Larry Stockmeyer
2002 Journal of the ACM  
The subject of this article is differential compression, the algorithmic task of finding common strings between versions of data and using them to encode one version compactly by describing it as a set  ...  We introduce two new techniques for differential compression and apply these to give additional algorithms that improve compression and time performance.  ...  We are grateful to Robert Morris, Norm Pass, and David Pease for their encouragement and advice.  ... 
doi:10.1145/567112.567116 fatcat:ymjewhftezbq3ojncjgu4fh6ka

Binary jumbled string matching for highly run-length compressible texts

Golnaz Badkobeh, Gabriele Fici, Steve Kroon, Zsuzsanna Lipták
2013 Information Processing Letters  
The construction time of our index is O(n+ρ^2ρ), where O(n) is the time for computing the run-length encoding of s and ρ is the length of this encoding---this is no worse than previous solutions if ρ =  ...  We propose an index constructed directly from the run-length encoding of s.  ...  Queries for the Binary Jumbled String Matching problem can be answered in O(log ρ) time, using an index of size O(min(ρ 2 , n)), where n is the length of the text and ρ the length of its run-length encoding  ... 
doi:10.1016/j.ipl.2013.05.007 fatcat:a4n6j43ozzgplo3k7af3jzhine

Image Compression using Approximate Matching and Run Length

Samir Kumar, Tuhin Utsab, Avishek Raychoudhury
2011 International Journal of Advanced Computer Science and Applications  
This study concentrates on the lossless compression of image using approximate matching technique and run length encoding.  ...  Keywords-lossless image compression; approximate matching; run length. I.  ...  We consider approximate matching algorithm and run length for our image compression.  ... 
doi:10.14569/ijacsa.2011.020617 fatcat:wx5vjtitcne6nccrcgzzazgrcq

Parameterized searching with mismatches for run-length encoded strings

Alberto Apostolico, Péter L. Erdős, Alpár Jüttner
2012 Theoretical Computer Science  
We present an algorithm for searching for parameterized occurrences of a patten in a textstring when both are given in run-length encoded form.  ...  Here r p and r t denote the number of runs in the corresponding encodings for p and t.  ...  Conclusion We have presented a method for computing the parameterized matching on run-length encoded strings over alphabets of arbitrary size.  ... 
doi:10.1016/j.tcs.2012.03.018 fatcat:d64xuplzpzbydcm3gnd2otssvy

Longest common subsequence problem for run-length-encoded strings

Shegufta Bakht Ahsan, Syeda Persia Aziz, M. Sohel Rahman
2012 2012 15th International Conference on Computer and Information Technology (ICCIT)  
In this paper, we present a new and efficient algorithm for solving the Longest Common Subsequence (LCS) problem between two run-length-encoded (RLE) strings.  ...  Then, our algorithm runs in O((k +ˆ ) + R log log(kˆ ) + R log log ω) time, where ω = k + and R is the total number of ordered pairs of positions at which the two RLE strings match.  ...  Compressing a string in this way is called run-length-encoding and a run-length-encoded string is abbreviated as an RLE string.  ... 
doi:10.1109/iccitechn.2012.6509736 fatcat:fp3gd7f52rhtbexpsc7ycea3zi

Longest Common Subsequence Problem for Run-Length-Encoded Strings

Shegufta Bakht Ahsan, Syeda Persia Aziz, M. Sohel Rahman
2014 Journal of Computers  
In this paper, we present a new and efficient algorithm for solving the Longest Common Subsequence (LCS) problem between two run-length-encoded (RLE) strings.  ...  Then, our algorithm runs in O((k +ˆ ) + R log log(kˆ ) + R log log ω) time, where ω = k + and R is the total number of ordered pairs of positions at which the two RLE strings match.  ...  Compressing a string in this way is called run-length-encoding and a run-length-encoded string is abbreviated as an RLE string.  ... 
doi:10.4304/jcp.9.8.1769-1775 fatcat:ygloq7ajuzfsvpu7pbludgv2oy

A Simple Reduction for Full-Permuted Pattern Matching Problems on Multi-Track Strings [article]

Carl Barton, Ewan Birney, Tomas Fitzgerald
2019 arXiv   pre-print
For polynomial time algorithms on single-track strings of length n there is a multiplicative penalty of not more than O(N)-time for the same algorithm on mt-strings of length n and track count N.  ...  Efficient algorithms for some full-permuted-match problems on multi-track strings have recently been presented.  ...  We have also shown that this encoding as a string is the best string encoding possible for this problem.  .  ... 
arXiv:1909.02364v5 fatcat:c5somhivc5eglkpa2bj5bbblry

A Scalable Architecture For High-Throughput Regular-Expression Pattern Matching

Benjamin C. Brodie, David E. Taylor, Ron K. Cytron
2006 SIGARCH Computer Architecture News  
We present and evaluate an architecture for highthroughput pattern matching of regular expressions.  ...  Our approach matches multiple patterns concurrently, responds rapidly to changes in the pattern set, and is well suited for synthesis in an ASIC or FPGA.  ...  We wish to maximize the length of the runs for the most columns, thereby minimizing the length of each encoded column.  ... 
doi:10.1145/1150019.1136500 fatcat:bzys2qwtunfuzmutehf472csiq

Fast and Simple Jumbled Indexing for Binary RLE Strings [article]

Luís Cunha, Simone Dantas, Travis Gagie, Roland Wittler, Luis Kowada, Jens Stoye
2017 arXiv   pre-print
(TCS, 2016) gave algorithms that index a binary string in O (n + ρ^2 ρ) time, where n is the length and ρ is the number of runs, and Giaquinta and Grabowski (IPL, 2013) gave one that runs in O (n + ρ^2  ...  Important papers have appeared recently on the problem of indexing binary strings for jumbled pattern matching, and further lowering the time bounds in terms of the input size would now be a breakthrough  ...  Given a binary string s of length n containing ρ runs of 1s, we can build an O(n)-bit index for constant-time jumbled pattern matching in O(n + ρ 2 ) time.  ... 
arXiv:1702.01280v2 fatcat:7lvjyl5p5rgrllvmyvpikln7hm

Run-Length Encoded Nondeterministic KMP and Suffix Automata [article]

Emanuele Giaquinta
2014 arXiv   pre-print
The input string can be given in either unencoded or run-length encoded form.  ...  We present a novel bit-parallel representation, based on the run-length encoding, of the nondeterministic KMP and suffix automata for a string P with at least two distinct symbols.  ...  While the present algorithm uses the run-length encoding, the input string can be given in either unencoded or run-length encoded form.  ... 
arXiv:1412.3688v2 fatcat:nnemeplth5e4loxk5ilspdb73e
« Previous Showing results 1 — 15 out of 64,200 results