The combinatorial pattern-matching group develops combinatorial algorithms for pattern search and synthesis problems for sequential and higher-dimensional data. The group is interested in the basic research of the theoretical aspects of the area as well as in various applications, mostly in bioinformatics and information retrieval. Recent results of the group include a very accurate error correction method for the so-called long reads in DNA sequencing as well as a new type of probabilistic model and learning algorithm for DNA motifs of transcription factor binding.