Algorithms on Strings

Start Date: 04/18/2021

Course Type: Common Course

Course Link: https://www.coursera.org/learn/algorithms-on-strings

About Course

World and internet is full of textual information. We search for information using textual queries, we read websites, books, e-mails. All those are strings from the point of view of computer science. To make sense of all that information and make search efficient, search engines use many string algorithms. Moreover, the emerging field of personalized medicine uses many search algorithms to find disease-causing mutations in the human genome. Do you have technical problems? Write to us: coursera@hse.ru

Course Syllabus

How would you search for a longest repeat in a string in LINEAR time? In 1973, Peter Weiner came up with a surprising solution that was based on suffix trees, the key data structure in pattern matching. Computer scientists were so impressed with his algorithm that they called it the Algorithm of the Year. In this lesson, we will explore some key ideas for pattern matching that will - through a series of trials and errors - bring us to suffix trees.

Coursera Plus banner featuring three learners and university partner logos

Course Introduction

Algorithms on Strings This is the third course in the String Programming Specialization. This course builds upon the algorithmic knowledge and patterns found in the first course, "Algorithms on Strings", and focuses on some specific programming constructs that may appear in your programs. These include regular expressions, to the NUL byte array, to the IPN instruction set, and so on. The emphasis of this course is on the actual implementation of a fairly complex algorithm in C, which is a moderate-sized program. Program execution time is covered in two parts. First, we introduce a couple of standard programming constructs that allow for very simple control flow. Second, we explain how to use the fact that we have our own language to interact with the outside world. We focus on the level of abstraction and flexibility needed to implement these abstractions in C. This course is intended to accompany, and ideally, follow, "Algorithms on Strings", but it is by itself sufficient for the purpose of completing the Level 3 course in the Specialization.Week 1: Core Concepts and Operations Week 2: Regular Expressions Week 3: To the NUL Byte Array Week 4: Program Execution Algorithms on Networks This course is the second course in the String Programming Specialization. This course builds upon the algorithmic knowledge and patterns found in the first course, "Algorithms on Networks", and

Course Tag

Suffix Tree Suffix Array Knuth–Morris–Pratt (KMP) Algorithm Algorithms On Strings

Related Wiki Topic

Article Example
Maxime Crochemore Maxime Crochemore (born 1947) is a French computer scientist known for his numerous contributions to algorithms on strings. He is currently a professor at King's College London.
Maxime Crochemore Crochemore has co-authored three well-known scientific monographs on the design of algorithms for string processing: "Text Algorithms" (1994; jointly with Wojciech Rytter), "Jewels of Stringology" (2002, jointly with Wojciech Rytter), and "Algorithms on Strings" (2007, jointly with Christophe Hancart and Thierry Lecroq).
Symposium on Discrete Algorithms SODA, the Annual ACM-SIAM Symposium on Discrete Algorithms is an academic conference in the field of theoretical computer science. It is considered to be one of the top conferences for research in algorithms and complexity. SODA has been organized annually since 1990, typically in January. SODA is jointly sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT) and the SIAM Activity Group on Discrete Mathematics.
European Symposium on Algorithms In 2002, ESA incorporated the conference Workshop on Algorithms Engineering (WAE). In its current format, ESA contains two distinct tracks with their own programme committees: a track on the design an analysis of algorithms, and a track on engineering and applications, together accepting around 70 contributions.
ACM Transactions on Algorithms ACM Transactions on Algorithms (TALG) is a quarterly peer-reviewed scientific journal covering the field of algorithms. It was established in 2005 and is published by the Association for Computing Machinery. The editor-in-chief is Aravind Srinivasan (University of Maryland). The journal was created when the editorial board of the "Journal of Algorithms" resigned out of protest to the pricing policies of the publisher, Elsevier. Apart from regular submissions, the journal also invites selected papers from the "ACM-SIAM Symposium on Discrete Algorithms (SODA)".
Strings! Strings! is the second album by guitarist Pat Martino recorded in 1967 and released on the Prestige label.
European Symposium on Algorithms Since 2001, ESA is co-located with other algorithms conferences and workshops in a combined meeting called ALGO. This is the largest European event devoted to algorithms, attracting hundreds of researchers.
Strings (tennis) Due to the tension present on the strings, elasticity and tension begins to decrease the moment they are installed in a racquet. "Dead strings", or strings which have lost their tension, cut down on the performance of a racquet. Dead strings may also hamper a tennis player's ability to generate power and pace, and may even make their arm sore.
European Symposium on Algorithms The European Symposium on Algorithms (ESA) is an international conference covering the field of algorithms. It has been held annually since 1993, typically in early Autumn in a different European location each year. Like most theoretical computer science conferences its contributions are strongly peer-reviewed; the articles appear in proceedings published in Springer Lecture Notes in Computer Science. Acceptance rate of ESA is 24% in 2012 in both "Design and Analysis" and "Engineering and Applications" tracks.
Puppet Strings "Puppet Strings" debuted at #77 on the "Billboard" 200.
Thirteen Strings Please note that the members of Thirteen Strings vary from time to time depending on the musicians schedules. The current players in the Thirteen Strings are:
Guqin strings The nylon-composite strings have various names such as "bingxian" (冰弦; "ice strings") or "fuhexian" (復合弦; "composite strings"). One of the main advertising points of these strings is that they are said to sound very close to the silk strings made prior to the 1950s when silk string production ceased for a while. They were tested on Zeng Chengwei qins and have the backing of Li Xiangting.
Accent on Strings "Accent on Strings" proved to be among the less successful of early TCN-9 offerings, running a couple months, and ending at the same time as "Campfire Favourites" and "The Johnny O'Connor Show".
Guqin strings Although most contemporary players use nylon-wrapped metal strings, some argue that nylon-wrapped metal strings cannot replace silk strings for their refinement of tone. Further, it is the case that nylon-wrapped metal strings can cause damage to the wood of old qins. Many traditionalists feel that the sound of the fingers of the left hand sliding on the strings to be a distinctive feature of qin music. The modern nylon-wrapped metal strings were very smooth in the past, but are now slightly modified in order to capture these sliding sounds.
Symposium on Parallelism in Algorithms and Architectures SPAA was first organised on 18–21 June 1989, in Santa Fe, New Mexico, United States. In 1989–2002, SPAA was known as Symposium on Parallel Algorithms and Architectures. In 2003, the name changed to "Symposium on Parallelism in Algorithms and Architectures" to reflect the extended scope of the conference.
Classical guitar strings Classical guitar strings are strings manufactured for use on classical guitars. While steel-string acoustic guitar strings and electric guitar strings are made of metal, modern classical guitar strings are made of nylon and nylon wound with wire, which produces a different sound to the metal strings. Classical guitar strings were originally made with animal intestine and silk wound with animal intestine up until World War II, when war restrictions led Albert Augustine Ltd. to develop nylon strings. Nylon guitar strings were put into production in 1948. Strings made from Fluorocarbon polymers have since been developed and are the main alternative to nylon strings.
Demon Strings In 2014, The Demon Strings, were given an official credit for strings on Albarn's debut solo studio album "Everyday Robots" and have featured in several live performances from Albarn promoting the album, including "The One Show".
Search algorithm Another important subclass of this category are the string searching algorithms, that search for patterns within strings. Two famous examples are the Boyer–Moore and Knuth–Morris–Pratt algorithms, and several algorithms based on the suffix tree data structure.
Strings (Unix) In computer software, strings is a program in Unix-like operating systems that finds and prints text strings embedded in binary files such as executables. It can be used on object files and core dumps.
Algorithms (journal) Algorithms is a peer-reviewed open access mathematics journal concerning design, analysis, and experiments on algorithms. The journal is published by MDPI and was established in 2008 by founding editor-in-chief is Kazuo Iwama. Its current editor-in-chief is Henning Fernau.