Dagstuhl Seminar Proceedings, Volume 6201,

• Rudolf Ahlswede, Alberto Apostolico, and Vladimir I. Levenshtein 06201 Abstracts Collection – Combinatorial and Algorithmic Foundations of Pattern and Association Discovery 10.4230/DagSemProc.06201.1
• Rudolf Ahlswede, Alberto Apostolico, and Vladimir I. Levenshtein 06201 Executive Summary – Combinatorial and Algorithmic Foundations of Pattern and Association Discovery 10.4230/DagSemProc.06201.2
• Lee Jones and Konstantin Rybnikov Local Minimax Learning of Approximately Polynomial Functions 10.4230/DagSemProc.06201.3
• Rudolf Ahlswede, Christian Deppe, and Vladimir Lebedev Non--binary error correcting codes with noiseless feedback, localized errors, or both 10.4230/DagSemProc.06201.4
• Alberto Apostolico and Cinzia Pizzi On the Monotonicity of the String Correction Factor for Words with Mismatches 10.4230/DagSemProc.06201.5
• Daniil Ryabko and Marcus Hutter Sequence prediction for non-stationary processes 10.4230/DagSemProc.06201.6
• Yury Lifshits Solving Classical String Problems an Compressed Texts 10.4230/DagSemProc.06201.7
• Zlatko Varbanov Some Results for Identification for Sources and its Extension to Liar Models 10.4230/DagSemProc.06201.8
• Andrei Asinowski Suballowable sequences of permutations 10.4230/DagSemProc.06201.9
• Péter L. Erdös, Péter Ligeti, Péter Sziklai, and David C. Torney Subwords in reverse-complement order 10.4230/DagSemProc.06201.10
• Elena Konstantinova Vertex reconstruction in Cayley graphs 10.4230/DagSemProc.06201.11