Combinatorics and Algorithmics of Strings
MetadataAfficher la notice complète
Currie, James D.
Crochemore, Maxime, James D. Currie, Gregory Kucherov, and Dirk Nowotka.“Combinatorics and Algorithmics of Strings (Dagstuhl Seminar 14111).” Dagstuhl Reports 4(3) (2014): 28-46. DOI: 10.4230/DagRep.4.3.28.
Strings (aka sequences or words) 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 (through DNA sequences) 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 is actually a core purpose of computer use. Algorithms to efficiently search through, analyze, (de-)compress, match, encode and 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.