@InProceedings{ahlswede_et_al:DagSemProc.06201.1,
author = {Ahlswede, Rudolf and Apostolico, Alberto and Levenshtein, Vladimir I.},
title = {{06201 Abstracts Collection – Combinatorial and Algorithmic Foundations of Pattern and Association Discovery}},
booktitle = {Combinatorial and Algorithmic Foundations of Pattern and Association Discovery},
pages = {1--15},
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.1},
URN = {urn:nbn:de:0030-drops-7873},
doi = {10.4230/DagSemProc.06201.1},
annote = {Keywords: Data compression, pattern matching, pattern discovery, search, sorting, molecular biology, reconstruction, genome rearrangements}
}
@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}
}
@InProceedings{jones_et_al:DagSemProc.06201.3,
author = {Jones, Lee and Rybnikov, Konstantin},
title = {{Local Minimax Learning of Approximately Polynomial Functions}},
booktitle = {Combinatorial and Algorithmic Foundations of Pattern and Association Discovery},
pages = {1--12},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2007},
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.3},
URN = {urn:nbn:de:0030-drops-8912},
doi = {10.4230/DagSemProc.06201.3},
annote = {Keywords: Local learning, statistical learning, estimator, minimax, convex optimization, quantifier elimination, semialgebraic, ridge regression, polynomial}
}
@InProceedings{ahlswede_et_al:DagSemProc.06201.4,
author = {Ahlswede, Rudolf and Deppe, Christian and Lebedev, Vladimir},
title = {{Non--binary error correcting codes with noiseless feedback, localized errors, or both}},
booktitle = {Combinatorial and Algorithmic Foundations of Pattern and Association Discovery},
pages = {1--4},
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.4},
URN = {urn:nbn:de:0030-drops-7849},
doi = {10.4230/DagSemProc.06201.4},
annote = {Keywords: Error-correcting codes, localized errors, feedback, variable length codes}
}
@InProceedings{apostolico_et_al:DagSemProc.06201.5,
author = {Apostolico, Alberto and Pizzi, Cinzia},
title = {{On the Monotonicity of the String Correction Factor for Words with Mismatches}},
booktitle = {Combinatorial and Algorithmic Foundations of Pattern and Association Discovery},
pages = {1--9},
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.5},
URN = {urn:nbn:de:0030-drops-7899},
doi = {10.4230/DagSemProc.06201.5},
annote = {Keywords: Pattern discovery, Motif, Over-represented word, Monotone score, Correction Factor}
}
@InProceedings{ryabko_et_al:DagSemProc.06201.6,
author = {Ryabko, Daniil and Hutter, Marcus},
title = {{Sequence prediction for non-stationary processes}},
booktitle = {Combinatorial and Algorithmic Foundations of Pattern and Association Discovery},
pages = {1--12},
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.6},
URN = {urn:nbn:de:0030-drops-7900},
doi = {10.4230/DagSemProc.06201.6},
annote = {Keywords: Sequence prediction, probability forecasting, local absolute continuity}
}
@InProceedings{lifshits:DagSemProc.06201.7,
author = {Lifshits, Yury},
title = {{Solving Classical String Problems an Compressed Texts}},
booktitle = {Combinatorial and Algorithmic Foundations of Pattern and Association Discovery},
pages = {1--10},
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.7},
URN = {urn:nbn:de:0030-drops-7984},
doi = {10.4230/DagSemProc.06201.7},
annote = {Keywords: Pattern matching, Compressed text}
}
@InProceedings{varbanov:DagSemProc.06201.8,
author = {Varbanov, Zlatko},
title = {{Some Results for Identification for Sources and its Extension to Liar Models}},
booktitle = {Combinatorial and Algorithmic Foundations of Pattern and Association Discovery},
pages = {1--4},
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.8},
URN = {urn:nbn:de:0030-drops-7820},
doi = {10.4230/DagSemProc.06201.8},
annote = {Keywords: Identification for sources, lies, prefix code}
}
@InProceedings{asinowski:DagSemProc.06201.9,
author = {Asinowski, Andrei},
title = {{Suballowable sequences of permutations}},
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.9},
URN = {urn:nbn:de:0030-drops-7833},
doi = {10.4230/DagSemProc.06201.9},
annote = {Keywords: Aequences of permutations}
}
@InProceedings{erdos_et_al:DagSemProc.06201.10,
author = {Erd\"{o}s, P\'{e}ter L. and Ligeti, P\'{e}ter and Sziklai, P\'{e}ter and Torney, David C.},
title = {{Subwords in reverse-complement order}},
booktitle = {Combinatorial and Algorithmic Foundations of Pattern and Association Discovery},
pages = {1--8},
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.10},
URN = {urn:nbn:de:0030-drops-7856},
doi = {10.4230/DagSemProc.06201.10},
annote = {Keywords: Reverse complement order, Reconstruction of words, Microarray experiments}
}
@InProceedings{konstantinova:DagSemProc.06201.11,
author = {Konstantinova, Elena},
title = {{Vertex reconstruction in Cayley graphs}},
booktitle = {Combinatorial and Algorithmic Foundations of Pattern and Association Discovery},
pages = {1--20},
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.11},
URN = {urn:nbn:de:0030-drops-7869},
doi = {10.4230/DagSemProc.06201.11},
annote = {Keywords: Reconstruction problems, Cayley graphs, the symmetric group, the signed permutation group, sorting by reversals, pancake problem}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing