Joint String Complexity for Markov Sources - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2012

Joint String Complexity for Markov Sources


String complexity is defined as the cardinality of a set of all distinct words (factors) of a given string. For two strings, we define $\textit{joint string complexity}$ as the set of words that are common to both strings. We also relax this definition and introduce $\textit{joint semi-complexity}$ restricted to the common words appearing at least twice in both strings. String complexity finds a number of applications from capturing the richness of a language to finding similarities between two genome sequences. In this paper we analyze joint complexity and joint semi-complexity when both strings are generated by a Markov source. The problem turns out to be quite challenging requiring subtle singularity analysis and saddle point method over infinity many saddle points leading to novel oscillatory phenomena with single and double periodicities.
Fichier principal
Vignette du fichier
dmAQ0123.pdf (451.8 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01197224 , version 1 (11-09-2015)



Philippe Jacquet, Wojciech Szpankowski. Joint String Complexity for Markov Sources. 23rd International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'12), 2012, Montreal, Canada. pp.303-322, ⟨10.46298/dmtcs.3001⟩. ⟨hal-01197224⟩


116 View
398 Download



Gmail Facebook Twitter LinkedIn More