Finding Maximal Quasiperiodicities in Strings
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Optimality of some algorithms to detect quasiperiodicities
Theoretical Computer Science
Cover array string reconstruction
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Efficient seeds computation revisited
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Hunting redundancies in strings
DLT'11 Proceedings of the 15th international conference on Developments in language theory
On the right-seed array of a string
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Linear time inference of strings from cover arrays using a binary alphabet
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Efficient seed computation revisited
Theoretical Computer Science
Hi-index | 0.00 |