1. Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics Doklady 10, 707–710 (1966)
2. de la Higuera, C., Casacuberta, F.: Topology of strings: Median string is NP-complete. Theoretical Computer Science 230, 39–48 (2000)
3. Fu, K.S.: Syntactical Pattern Recognition and Applications. Prentice-Hall, Englewood Cliffs (1982)
4. Kohonen, T.: Median Strings. PRL 3, 309–313 (1985)
5. Martínez-Hinarejos, C.D., Juan, A., Casacuberta, F.: Use of Median String for Classification. In: ICPR, pp. 2903–2906 (2000)