Complexity of Sequential Pattern Matching Algorithms
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Improved Behaviour of Tries by the "Symmetrization" of the Source
DCC '02 Proceedings of the Data Compression Conference
Towards a complete characterization of tries
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Fast BWT in small space by blockwise suffix sorting
Theoretical Computer Science
Analysis of the Size of Antidictionary in DCA
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Statistical Properties of Factor Oracles
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Average case analysis of algorithms
Algorithms and theory of computation handbook
ACM Transactions on Algorithms (TALG)
Statistical properties of factor oracles
Journal of Discrete Algorithms
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Counting occurrences for a finite set of words: Combinatorial methods
ACM Transactions on Algorithms (TALG)
An efficient algorithm for identifying the most contributory substring
DaWaK'07 Proceedings of the 9th international conference on Data Warehousing and Knowledge Discovery
Distributed string mining for high-throughput sequencing data
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
| Hi-index | 0.00 |