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.
提供：
カリフォルニア大学サンディエゴ校
HSE University
データ構造とアルゴリズム専門講座カリフォルニア大学サンディエゴ校このコースについて
22,375 最近の表示
柔軟性のある期限
スケジュールに従って期限をリセットします。
共有できる証明書
修了時に証明書を取得
100%オンライン
自分のスケジュールですぐに学習を始めてください。
次における6の4コース
中級レベル
約18時間で修了
英語
字幕：アラビア語, フランス語, ポルトガル語（ヨーロッパ）, イタリア語, ベトナム語, ドイツ語, ロシア語, 英語, スペイン語
習得するスキル
Suffix TreeSuffix ArrayKnuth–Morris–Pratt (KMP) AlgorithmAlgorithms On Strings
柔軟性のある期限
スケジュールに従って期限をリセットします。
共有できる証明書
修了時に証明書を取得
100%オンライン
自分のスケジュールですぐに学習を始めてください。
次における6の4コース
中級レベル
約18時間で修了
英語
字幕：アラビア語, フランス語, ポルトガル語（ヨーロッパ）, イタリア語, ベトナム語, ドイツ語, ロシア語, 英語, スペイン語
提供：
カリフォルニア大学サンディエゴ校
UC San Diego is an academic powerhouse and economic engine, recognized as one of the top 10 public universities by U.S. News and World Report. Innovation is central to who we are and what we do. Here, students learn that knowledge isn't just acquired in the classroom—life is their laboratory.
HSE University
HSE University is one of the top research universities in Russia. Established in 1992 to promote new research and teaching in economics and related disciplines, it now offers programs at all levels of university education across an extraordinary range of fields of study including business, sociology, cultural studies, philosophy, political science, international relations, law, Asian studies, media and communicamathematics, engineering, and more.
シラバス - 本コースの学習内容
5時間で修了
Suffix Trees
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.
5時間で修了
5件のビデオ （合計27分）, 7 学習用教材, 1 個のテスト
4時間で修了
Burrows-Wheeler Transform and Suffix Arrays
Although EXACT pattern matching with suffix trees is fast, it is not clear how to use suffix trees for APPROXIMATE pattern matching. In 1994, Michael Burrows and David Wheeler invented an ingenious algorithm for text compression that is now known as Burrows-Wheeler Transform. They knew nothing about genomics, and they could not have imagined that 15 years later their algorithm will become the workhorse of biologists searching for genomic mutations. But what text compression has to do with pattern matching??? In this lesson you will learn that the fate of an algorithm is often hard to predict – its applications may appear in a field that has nothing to do with the original plan of its inventors.
4時間で修了
5件のビデオ （合計30分）, 4 学習用教材, 1 個のテスト
3時間で修了
Knuth–Morris–Pratt Algorithm
Congratulations, you have now learned the key pattern matching concepts: tries, suffix trees, suffix arrays and even the Burrows-Wheeler transform! However, some of the results Pavel mentioned remain mysterious: e.g., how can we perform exact pattern matching in O(|Text|) time rather than in O(|Text|*|Pattern|) time as in the naïve brute force algorithm? How can it be that matching a 1000-nucleotide pattern against the human genome is nearly as fast as matching a 3-nucleotide pattern??? Also, even though Pavel showed how to quickly construct the suffix array given the suffix tree, he has not revealed the magic behind the fast algorithms for the suffix tree construction!In this module, Miсhael will address some algorithmic challenges that Pavel tried to hide from you :) such as the Knuth-Morris-Pratt algorithm for exact pattern matching and more efficient algorithms for suffix tree and suffix array construction.
3時間で修了
5件のビデオ （合計35分）, 2 学習用教材, 1 個のテスト
5時間で修了
Constructing Suffix Arrays and Suffix Trees
In this module we continue studying algorithmic challenges of the string algorithms. You will learn an O(n log n) algorithm for suffix array construction and a linear time algorithm for construction of suffix tree from a suffix array. You will also implement these algorithms and the Knuth-Morris-Pratt algorithm in the last Programming Assignment in this course.
5時間で修了
11件のビデオ （合計76分）, 5 学習用教材, 2 個のテスト
レビュー
文字列アルゴリズム からの人気レビュー
CSにより2019年7月7日
Very good course. String algorithms are very important in day today life and one should really know how to solve command problems related to it. This course have described everything so well.
PAにより2020年5月12日
course content was great but i personally feels some difficulties in the implementation part so the course is meant to be more implementation oriented . thank you for the wondorful course
NRにより2019年10月18日
Very well put together course. Challenging but understandable. I highly recommend you stick out. If you get stuck check the forums there's lots of helpful things there. Time well spent!
ABにより2017年10月20日
Its a very good course overall. Just felt that towards the end the material got too much to digest, might be a good idea to split the contents of weeks 3 and 4 into 3 or 4 weeks.
データ構造とアルゴリズム専門講座について
Computer science legend Donald Knuth once said “I don’t understand things unless I try to program them.” We also believe that the best way to learn an algorithm is to program it. However, many excellent books and online courses on algorithms, that excel in introducing algorithmic ideas, have not yet succeeded in teaching you how to implement algorithms, the crucial computer science skill that you have to master at your next job interview. We tried to fill this gap by forming a diverse team of instructors that includes world-leading experts in theoretical and applied algorithms at UCSD (Daniel Kane, Alexander Kulikov, and Pavel Pevzner), a chief data scientist at Yandex (Michael Levin), and a former software engineer at Google (Neil Rhodes). This unique combination of skills makes this Specialization different from other excellent MOOCs on algorithms that are all developed by theoretical computer scientists. While these MOOCs focus on theory, our Specialization is a mix of algorithmic theory/practice/applications with software engineering. You will learn algorithms by implementing nearly 100 coding problems in a programming language of your choice. To the best of knowledge, no other online course in Algorithms comes close to offering you a wealth of programming challenges (and puzzles!) that you may face at your next job interview. We invested over 3000 hours into designing our challenges as an alternative to multiple choice questions that you usually find in MOOCs.
よくある質問
いつ講座や課題にアクセスできるようになりますか？
この専門講座をサブスクライブすると何を行うことができるようになりますか？
学資援助はありますか？
さらに質問がある場合は、受講者向けヘルプセンターにアクセスしてください。
