Chevron Left
返回到 字符串算法

學生對 加州大学圣地亚哥分校 提供的 字符串算法 的評價和反饋

4.5
754 個評分
131 條評論

課程概述

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....

熱門審閱

CS

Jul 08, 2019

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.

PP

May 13, 2020

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

篩選依據:

101 - 字符串算法 的 125 個評論(共 127 個)

創建者 Guillaume

Dec 15, 2016

Very focused on bioinformatics problems.

創建者 Miguel A M H

Aug 14, 2016

The lectures are a little bit confused

創建者 YANGXIAOKANG L

Nov 08, 2019

The explanation is very clear

創建者 Hidetake T

Jun 11, 2019

necessary experience

創建者 Carlos D R S

Jan 24, 2018

Está perro

創建者 Padmakumar N

Aug 05, 2017

Very Good

創建者 Ayush S

May 01, 2020

perfect

創建者 Kota M

Sep 21, 2016

The lecture was very abstract and difficult. I could pass the course somehow by writing the code presented in the lecture, but I must say I understand less than the half of the course contents.

###

Responding to question from the instructor, I clarify the comments above.

I found the whole lecture difficult. This may be because the subject is not something I have even thought about. It was difficult to understand the difference and importance of key concepts such as trie, suffix, class, etc. Overall, I learned that the tricks somehow work, but my comprehension was not as deep as I can think about the extension or applications. I guess more examples or providing intuition would help me to digest the material.

創建者 David F

Mar 30, 2017

My least favorite course in the specialization. The lectures are harder to follow, and are actually all about bioinformatics algorithms, which wasn't clear from the course description. Thankfully, as with the graphs course, Michael Levin wades in to save the day for the last couple of weeks. His lectures are really well structured, intuitive and clear.

創建者 Daniel P

Feb 27, 2018

I didn't think the lectures or slides in this course were clear and informative. It seems like they are going for the briefest, most efficient exposition possible. Which is not the same as making the material clear and understandable.

創建者 Jenna W

Jun 20, 2017

Continuing a steep curve, but I feel some of the assignments and psuedo-code are not as well explained in these lectures as in earlier ones.

創建者 Fabrice L

Feb 14, 2018

This module is a little less interesting than the other ones. Also the explanations are a bit more messy and not as thorough.

創建者 John B

Mar 26, 2018

Quite a few times the algorithms were poorly explained, with incomplete or misleading pseudocode.

創建者 Praveer D

Oct 25, 2019

KMP Algorithm not explained well. Initial few lectures on BWT were very fast.

創建者 Lingjian K

Feb 20, 2017

Good contents, but lectures could be improved for clarity.

創建者 Lev S

Mar 12, 2017

I think last week was too complex and not that exciting.

創建者 SAHADEVAREDDY A S

Jul 24, 2019

Need to be explained more nicely

創建者 Grigoriy O

Oct 02, 2016

Very difficult test programs

創建者 Alexander M

Jun 29, 2017

.

創建者 Miguel R

Oct 19, 2016

This course is not precisely bad, but it's very lacking compared to the other courses in the specialization. Here are my complaints:

-Much of the more interesting bits say "check out this other course in bioinformatics for details". Of course, if you aren't registered for that other course, you don't have access to those materials.

-Not a lot of thought went into the homeworks. All of them are "implement this. Here is some pseudocode", with no "think about a problem that can be solved with the same ideas", like the other courses in the specialization (which are, in my opinion, much better).

-We saw 4 algorithms for string matching (KMP, Rabin-Karp, suffix array matching, Burrow-Wheeler's transform), but virtually no discussion on when to use each one, strengths and weaknesses, and so on. Also, no Boyer-Moore?

-After passing all test cases for a homework, we should be able to download a solution with the correct implementation, in order to improve our own.

創建者 Henry R

Jul 13, 2018

It really disappointed me.It was really badly illustrated especially in Burrow-Wheeler Transform. I total lost even watching video lectures many times. Burrow-Wheeler Transform and Inverse Burrow-Wheeler Transform are complex and complicated. The teacher only gave some specific examples and explanation is not clear.

創建者 Juho V

Jul 26, 2018

Really interesting stuff, but the explanations are not always very clear. Some of the algorithms are quite complex and they cannot be made any easier than that, but some well chosen visualizations would do wonders.

創建者 Arpit V

Mar 26, 2019

The explanation of suffix arrays and suffix trees could have been more slow and details explanation. I still had to refer videos on youtube to understand those.

創建者 Ilya E

Jun 16, 2019

Sometimes explanations in lectures are hardly understandable and examples are not very descriptive. I had search more clear explanation by himself.

創建者 Fabian B

Jan 30, 2017

The excercises should be set up to be more comfortable.