Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

85

Voted

ALGORITHMICA
1999

75views more ALGORITHMICA 1999»

Counting Distinct Strings

15 years 2 months ago

Counting Distinct Strings

Download pictor.math.uqam.ca

Dennis Moore, William F. Smyth, D. Miller

Real-time Traffic

ALGORITHMICA 1999 |

claim paper

Related Content

» Improving calculations of the number of distinct alignments of two strings

» Algorithms for subsequence combinatorics

» Counting Distance Permutations

» Detecting Article Errors Based on the Mass Count Distinction

» Why go logarithmic if we can go linear Towards effective distinct counting of search traff...

» Strings with Maximally Many Distinct Subsequences and Substrings

» Counting distinct objects over sliding windows

» The averagecase complexity of counting distinct elements

» Counting and Verifying Maximal Palindromes

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1999
Where	ALGORITHMICA
Authors	Dennis Moore, William F. Smyth, D. Miller

Comments (0)