The goals of this seminar have been (1) to identify and match recently developed methods to specific tasks and data sets in a core of application areas; next, based on feedback from the specific applied domain, (2) to fine tune and personalize those applications, and finally (3) to identify and tackle novel combinatorial and algorithmic problems, in some cases all the way to the development of novel software tools.
@InProceedings{ahlswede_et_al:DagSemProc.06201.2, author = {Ahlswede, Rudolf and Apostolico, Alberto and Levenshtein, Vladimir I.}, title = {{06201 Executive Summary – Combinatorial and Algorithmic Foundations of Pattern and Association Discovery}}, booktitle = {Combinatorial and Algorithmic Foundations of Pattern and Association Discovery}, pages = {1--2}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6201}, editor = {Rudolf Ahlswede and Alberto Apostolico and Vladimir I. Levenshtein}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06201.2}, URN = {urn:nbn:de:0030-drops-7926}, doi = {10.4230/DagSemProc.06201.2}, annote = {Keywords: Data compression, pattern matching, pattern discovery, search, sorting, molecular biology, reconstruction, genome rearrangements} }
Feedback for Dagstuhl Publishing