Abstract
Purchase PDF (410 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (2)
Purchase PDF (115 K)
doi:10.1016/S0020-0190(97)00057-4 
Copyright © 1997 Published by Elsevier Science B.V.
An O(n log n) algorithm for finding dissimilar strings
Received 24 April 1996;
revised 17 February 1997.
Communicated by V. Ramachandran
Available online 12 May 1998.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
Let Σ be a finite alphabet and x ε ∑n. A string y ε ∑m is said to be k-dissimilar to x, if no k length substring of x is equal to any k length substring of y. We present an O(n log n) algorithm which on input x ε ∑n and an integer m 
n outputs an integer k and y ε ∑m such that:
1. (1) y is k-dissimilar to x.
2. (2) There does not exist a string z of length m which is k − 1 dissimilar to x.
Author Keywords: Algorithms; Analysis of algorithms; Combinatorial problems; Computational molecular biology; Probabilistic method; Lovász local lemma
