(Un)expected behavior of typical suffix trees
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Discovering Unordered and Ordered Phrase Association Patterns for Text Mining
PADKK '00 Proceedings of the 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, Current Issues and New Applications
A Fast Algorithm for Discovering Optimal String Patterns in Large Text Databases
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Efficient Data Mining from Large Text Databases
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
Characteristic Sets of Strings Common to Semi-structured Documents
DS '99 Proceedings of the Second International Conference on Discovery Science
Maximizing Agreement with a Classification by Bounded or Unbounded Number of Associated Words
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Random Structures & Algorithms
Practical methods for constructing suffix trees
The VLDB Journal — The International Journal on Very Large Data Bases
An analysis of the height of tries with random weights on the edges
Combinatorics, Probability and Computing
On the Construction of an Antidictionary with Linear Complexity Using the Suffix Tree
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
p-Suffix sorting as arithmetic coding
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
p-Suffix sorting as arithmetic coding
Journal of Discrete Algorithms
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
Computing the longest common prefix array based on the Burrows-Wheeler transform
Journal of Discrete Algorithms
| Hi-index | 0.00 |