Introduction to Algorithms
Finding All Common Intervals of k Permutations
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Efficient text fingerprinting via Parikh mapping
Journal of Discrete Algorithms
Journal of Discrete Algorithms
Computing common intervals of K permutations, with applications to modular decomposition of graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Faster query algorithms for the text fingerprinting problem
Information and Computation
Various improvements to text fingerprinting
Journal of Discrete Algorithms
| Hi-index | 0.00 |
Let s=s"1..s"n be a text (or sequence) on a finite alphabet @S. A fingerprint in s is the set of distinct characters contained in one of its substrings. Fingerprinting a text consists of computing the set F of all fingerprints of all its substrings and being able to efficiently answer several questions on this set. A given fingerprint f@?F is represented by a binary array, F, of size |@S| named a fingerprint table. A fingerprint, f@?F, admits a number of maximal locations in S, that is the alphabet of s"i..s"j is f and s"i"-"1,s"j"+"1, if defined, are not in f. The set of maximal locations is L,|L|=