Using BWT for Pattern Matching - Algorithms on Strings

Veröffentlicht am: 10 November 2020
auf dem Kanal: Trieu Truong Nhan

1,329

Link to this course:
https://click.linksynergy.com/deeplin...
Using BWT for Pattern Matching - Algorithms on Strings
Data Structures and Algorithms Specialization
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.
Suffix Tree, Suffix Array, Knuth–Morris–Pratt (KMP) Algorithm, Algorithms On Strings
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!,Takes your understanding of string algorithms to the next level and gives you new ideas of handling large amount of memory intensive tasks.
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.
Using BWT for Pattern Matching - Algorithms on Strings
Copyright Disclaimer under Section 107 of the copyright act 1976, allowance is made for fair use for purposes such as criticism, comment, news reporting, scholarship, and research. Fair use is a use permitted by copyright statute that might otherwise be infringing. Non-profit, educational or personal use tips the balance in favour of fair use.

Auf dieser Seite können Sie das Online-Video Using BWT for Pattern Matching - Algorithms on Strings mit der Dauer stunde minuten sekunde in guter Qualität ansehen, das der Benutzer Trieu Truong Nhan 10 November 2020 hochgeladen hat, den Link mit Freunden und Bekannten teilen, dieses Video wurde auf Youtube bereits 1,329 Mal angesehen und es wurde von 23 den Zuschauern gefallen. Viel Spaß beim Betrachtenden Zuschauern gefallen!