Reoptimization of the Shortest Common Superstring Problem
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Mining transposed motifs in music
Journal of Intelligent Information Systems
The gapped suffix array: a new index structure for fast approximate matching
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Hunting redundancies in strings
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Building phylogeny with minimal absent words
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Efficient algorithms for three variants of the LPF table
Journal of Discrete Algorithms
Using minimal absent words to build phylogeny
Theoretical Computer Science
| Hi-index | 0.00 |