• Corpus ID: 2950258

String Superprimitivity Test on the Reconfigurable Bus Model ∗

@inproceedings{Yang2007StringST,
  title={String Superprimitivity Test on the Reconfigurable Bus Model ∗},
  author={Chang-Biau Yang and Kuo-Si Huang},
  year={2007}
}
String regularities such as repetition, palindrome, period, seed, square, cover, etc., have been studied extensively recently. Particularly, string regularities play an important role of applications in bioinformatics tools. For a given string, its quasiperiod is the cover with the minimum length, which can be used in the hybridization method in DNA sequencing. Many algorithms have been proposed to solve some computational problems in O(1) time on the reconfigurable bus model. In this paper, we… 
1 Citations

Figures from this paper

References

SHOWING 1-10 OF 15 REFERENCES
Testing String Superprimitivity in Parallel
Finding all periods and initial palindromes of a string in parallel
TLDR
An optimalO(log logn)-time CRCW-PRAM algorithm for computing all period lengths of a string is presented and a lower bound is derived for finding initial palindromes by modifying a known lower bound for finding the period length of astring.
Optimal parallel detection of squares in strings
TLDR
It is shown that the square-freedom of a string ofn symbols over an arbitrary alphabet can be tested by a CRCW PRAM withn processors inO(logn) time and linear auxiliary space and the number of processors can be reduced ton/logn without affecting the time complexity of this strategy.
An On-Line String Superprimitivity Test
An O(n log n) Algorithm for Finding All Repetitions in a String
Fast Pattern Matching in Strings
TLDR
An algorithm is presented which finds all occurrences of one given string within another, in running time proportional to the sum of the lengths of the strings, showing that the set of concatenations of even palindromes, i.e., the language $\{\alpha \alpha ^R\}^*$, can be recognized in linear time.
Optimal Parallel Superprimitivity Testing for Square Arrays
TLDR
An optimal O(log log n) time algorithm is presented on the CRCW PRAM which tests whether a square array, A, of size n×n, is superprimitive and returns the quasiperiod, i.e., the smallest square array that covers A.
Optimal Superprimitivity Testing for Strings
Computing the covers of a string in linear time
TLDR
The characterization theorem gives rise to a simple recursive algorithm which computes all the covers of x in time \Theta(n) by avoiding unnecessary checks, and appears to execute more quickly than that given in [2].
An Optimal O(log log n) Time Parallel String Matching Algorithm
An optimal $O(\log \log n)$ time parallel algorithm for string matching on CROW-PRAM is presented. It improves previous results of Galil [Inform, and Control, 67 (1985), pp. 144–157] and Vishkin
...
...