HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Common words between two random strings

Philippe Jacquet 1
1 HIPERCOM - High performance communication
Inria Paris-Rocquencourt, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, X - École polytechnique, CNRS - Centre National de la Recherche Scientifique : UMR
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.
Document type :
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Tuesday, May 23, 2006 - 4:56:17 PM
Last modification on : Friday, February 4, 2022 - 3:13:45 AM
Long-term archiving on: : Tuesday, February 22, 2011 - 11:55:08 AM


  • HAL Id : inria-00071368, version 1



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



Record views


Files downloads