A new method of approximating the probability of matching common words in multiple random sequences (Q607627): Difference between revisions

@@ Property / cites work @@
+ON THE POWER FUNCTION OF THE LONGEST RUN AS A TEST FOR RANDOMNESS IN A SEQUENCE OF ALTERNATIVES
+Normal rank
@@ Property / cites work @@
+Periods in strings
@@ Property / cites work: Periods in strings / rank @@
+Normal rank
@@ Property / cites work @@
+Q3938285
@@ Property / cites work: Q3938285 / rank @@
+Normal rank
@@ Property / cites work @@
+First passage time for some stationary processes
@@ Property / cites work: First passage time for some stationary processes / rank @@
+Normal rank
@@ Property / cites work @@
+Estimating the distribution of one-dimensional discrete scan statistics viewed as extremes of 1-dependent stationary sequences
+Normal rank
@@ Property / cites work @@
+A new method of approximating the probability of matching common words in multiple random sequences
+Normal rank
@@ Property / cites work @@
+Maximal length of common words among random letter sequences
+Normal rank
@@ Property / cites work @@
+Matching among multiple random sequences
@@ Property / cites work: Matching among multiple random sequences / rank @@
+Normal rank
@@ Property / cites work @@
+Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata
+Normal rank
@@ Property / cites work @@
+Q2723967
@@ Property / cites work: Q2723967 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact distribution of word occurrences in a random sequence of letters
+Normal rank