On overabundant words and their application to biological sequence analysis | 0 | 0.34 | 2019 |
On-line weighted pattern matching. | 0 | 0.34 | 2019 |
Extracting powers and periods in a word from its runs structure | 16 | 0.67 | 2014 |
A note on efficient computation of all Abelian periods in a string | 7 | 0.61 | 2013 |
Efficient seed computation revisited | 2 | 0.38 | 2013 |
The maximal number of cubic runs in a word | 1 | 0.35 | 2012 |
New simple efficient algorithms computing powers and runs in strings. | 3 | 0.40 | 2010 |
Implementing approximate regularities | 1 | 0.36 | 2005 |
Computing Approximate Repetitions in Musical Sequences | 9 | 0.76 | 2000 |
Parallel RAM algorithms for factorizing words | 6 | 0.66 | 1994 |
PRAM algorithms for identifying polygon similarity | 1 | 0.38 | 1989 |
On O(n log n) cost parallel algorithm for the single function coarsest partition problem | 1 | 0.40 | 1987 |
Monte Carlo circuits for the Abelian Permutation group intersection problem | 1 | 0.43 | 1986 |
Computing in general Abelian groups is hard | 4 | 0.58 | 1985 |