License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.1.2.47
URN: urn:nbn:de:0030-drops-31554
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2011/3155/
Go back to Dagstuhl Reports

Crochemore, Maxime ; Kari, Lila ; Mohri, Mehryar ; Nowotka, Dirk
Weitere Beteiligte (Hrsg. etc.): Maxime Crochemore and Lila Kari and Mehryar Mohri and Dirk Nowotka

Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081)

pdf-format:
dagrep_v001_i002_p047_s11081.pdf (0.9 MB)

Abstract

Sequences form the most basic and natural data
structure. They occur whenever information is electronically
transmitted (as bit streams), when natural language text is spoken or
written down (as words over, for example, the latin alphabet), in the
process of heredity transmission in living cells (as DNA sequence) or
the protein synthesis (as sequence of amino acids), and in many more
different contexts. Given this universal form of representing
information, the need to process strings is apparent and actually a
core purpose of computer use. Algorithms to efficiently search
through, analyze, (de-)compress, match, learn, and encode/decode strings
are therefore of chief interest. Combinatorial problems about strings
lie at the core of such algorithmic questions. Many such combinatorial
problems are common in the string processing efforts in the different
fields of application.

Scientists working in the fields of Combinatorics on Words, Computational Biology, Stringology, Natural Computing, and Machine Learning were invited to consider the seminar's topic from a~wide range of perspectives. This report documents the program and the outcomes of Dagstuhl Seminar 11081
``Combinatorial and Algorithmic Aspects of Sequence Processing''.

BibTeX - Entry

@Article{crochemore_et_al:DR:2011:3155,
  author =	{Maxime Crochemore and Lila Kari and Mehryar Mohri and Dirk Nowotka},
  title =	{{Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081)}},
  pages =	{47--66},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2011},
  volume =	{1},
  number =	{2},
  editor =	{Maxime Crochemore and Lila Kari and Mehryar Mohri and Dirk Nowotka},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2011/3155},
  URN =		{urn:nbn:de:0030-drops-31554},
  doi =		{10.4230/DagRep.1.2.47},
  annote =	{Keywords: Combinatorics on words, computational biology, stringology, natural computing, machine learning}
}

Keywords: Combinatorics on words, computational biology, stringology, natural computing, machine learning
Collection: Dagstuhl Reports, Volume 1, Issue 2
Issue Date: 2011
Date of publication: 29.06.2011

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI