Common words between two random strings - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2006

Common words between two random strings

Philippe Jacquet

Abstract

We investigate the problem of enumerating the words that are common to two random strings. We show that when the source models are memoriless that the number of common words is sublinear in the length of the sequence, and linear when the source models are exactly the same. We draw the same conclusions for the number of common nodes in the associated respective suffix trees.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-5899.pdf (296.36 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00071368 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00071368 , version 1

Cite

Philippe Jacquet. Common words between two random strings. [Research Report] RR-5899, INRIA. 2006. ⟨inria-00071368⟩
60 View
165 Download

Share

Gmail Facebook Twitter LinkedIn More