Abstract Time series can be effectively represented by strings. The median concept is useful in various contexts. In this chapter its adaptation to the domain of strings is discussed. We introduce the notion of median string and provide related theoretical results. Then, we give a review of algorithmic procedures for efficiently computing median strings. Some experimental results will be reported to demonstrate the median concept and to compare some of the considered algorithms.