51 citations · 54 across the 4 of their papers we have counts for
4 papers
On the cyclic regularities of strings
Oluwole Ajala, Miznah Alshammary, Mai Alzamel +5
Regularities in strings are often related to periods and covers, which have extensively been studied, and algorithms for their efficient computation have broad application. In this…
Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform
Jacqueline W. Daykin, Richard Groult, Yannick Guesnet +6
A degenerate or indeterminate string on an alphabet is a sequence of non-empty subsets of . Given a degenerate string of length , we present a new method based on the…
Towards a Unified Taxonomy of Biclustering Methods
Dmitry I. Ignatov, Bruce W. Watson
Being an unsupervised machine learning and data mining technique, biclustering and its multimodal extensions are becoming popular tools for analysing object-attribute data in diffe…
Incremental construction of minimal acyclic finite-state automata
Jan Daciuk, Stoyan Mihov, Bruce Watson +1
In this paper, we describe a new method for constructing minimal, deterministic, acyclic finite-state automata from a set of strings. Traditional methods consist of two phases: the…