Algorithms for Longest Common Abelian Factors-Reference-Cited by-同舟云学术

Algorithms for Longest Common Abelian Factors

Published:2016-08 Issue:05 Volume:27 Page:529-543
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

Alatabbi Ali¹,Iliopoulos Costas S.¹,Langiu Alessio²,Rahman M. Sohel³

Affiliation:

1. King’s College London, London, UK

2. IAMC-CNR - National Research Council, Unit of Capo Granitola, TP, Italy

3. AℓEDA Group, Department of CSE, BUET, Dhaka-1000, Bangladesh

Abstract

In this paper we consider the problem of computing the longest common abelian factor (LCAF) between two given strings. We present a simple [Formula: see text] time algorithm, where n is the length of the strings and [Formula: see text] is the alphabet size, and a sub-quadratic running time solution for the binary string case, both having linear space requirement. Furthermore, we present a modified algorithm applying some interesting tricks and experimentally show that the resulting algorithm runs faster.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054116500143

Reference4 articles.

1. Indexing permutations for binary strings

2. Sub-quadratic time and linear space data structures for permutation matching in binary strings

3. On Context-Free Languages

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On Abelian Longest Common Factor with and without RLE;Fundamenta Informaticae;2018-11-03

2. Computing Abelian String Regularities Based on RLE;Lecture Notes in Computer Science;2018

3. Longest Common Abelian Factors and Large Alphabets;String Processing and Information Retrieval;2016