An O(n log n) algorithm for finding all repetitions in a string
Journal of Algorithms
Order statistics on a linear array with a reconfigurable bus
Future Generation Computer Systems
An Optimal O(log log n)-Time Parallel Algorithm for Detecting all Squares in a String
SIAM Journal on Computing
IEEE Transactions on Parallel and Distributed Systems
Linear array with a reconfigurable pipelined bus system—concepts and applications
Information Sciences: an International Journal - special issue on parallel and distributed processing
Two dimensional maximal elements problem on a reconfigurable optical pipelined bus system
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Optimally scaling permutation routing on reconfigurable linear arrays with optical buses
Journal of Parallel and Distributed Computing
Efficient Graph-Theoretic Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System
The Journal of Supercomputing
Finding Maximal Repetitions in a Word in Linear Time
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Finding Repeats with Fixed Gap
SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
Computing on the restricted LARPBS model
ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
Fast parallel algorithms for the longest common subsequence problem using an optical bus
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III
Computers and Electrical Engineering
An efficient sequence alignment algorithm on a LARPBS
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
| Hi-index | 0.00 |
The optical bus based arrays have recently shown many applications. In this paper we use the pipelining ability of the LARPBS to solve the repetitions detection problem. We propose an algorithm that finds all kind of repetitions in a string including k-power repetitions, overlapping repetitions and non-contiguous repetitions. For a given distance, this operation is performed in O(1) communication cycle with a constant computation time processors on a O(n) processors LARPBS for a string of length n. For all the periods, it is O(n) bus cycle. No previous algorithms were known for this problem on the LARPBS.