Alexander S. Kulikov
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. 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. National Research University – Higher School of Economics (HSE) 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. Learn more on www.hse.ru
Instructor Details
Courses : 8
Specification: Algorithms on Strings
|
47 reviews for Algorithms on Strings
Add a review
| Price | Free |
|---|---|
| Provider | |
| Duration | 16 hours |
| Year | 2016 |
| Level | Intermediate |
| Language | English |
| Certificate | Yes |
| Quizzes | Yes |
![The Design and Analysis of Algorithm Masterclass [ 2019 ]](https://courses.javacodegeeks.com/wp-content/uploads/2020/02/2484706_b943-300x300.jpg)
Lin M K –
Very Challenging! Assignments are great to learn the algorithms deeply.
JICHEN W –
Real Challenge one but fully enjoy
Troy D –
too much focus on DNA problem domain, too abstract & fancy pants complications for any practical use interesting as an intellectual exercise tho, the power of chaining crazy ideas to solve hard problems
Carlos D R S –
Esta perro
Fabrice L –
This module is a little less interesting than the other ones. Also the explanations are a bit more messy and not as thorough.
Daniel P –
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.
Pablo E M M –
Great Course. It ‘is very challenge
Tamilarasu S –
Good course that teaches Burrows wheeler transform, KMP algorithm. The assignments are also very good.
John B –
Quite a few times the algorithms were poorly explained, with incomplete or misleading pseudocode.
Saurab D –
Some of the algorithms are too hard to implement but worth the effort.
Joseph G N –
An amazing course it cover a lot of content in few weeks
Oliver A –
The course content was a bit disconnected this time with some missing parts in between. Maybe it would been better to start with simple string matching and basic data structures and only then progress to the genom processing part. Fortunately the programming assignment cleared a great deal of the confusion. Never the less a very good course!
Abhishek R –
It’s a very thought provoking course. I am into job for last 16 years and after getting into leadership role, hardly got into solving problems personally. This refreshed my passion and I connected well. I could not spend as much time as needed but overall I enjoyed the learning and the problem assignment. Worth trying!!
Ganesan P –
i enjoyed the course. The course lecture for week 3 and week 4 can do better with presentations. One looses focus very quickly when the instructor keeps speaking, but the material itself is not hard. I had refer to outside material to understand the lecture and had to spend time. I would recommend Ben Langmeade lectures for to get grip on BWT and excellent lecture on KMP and Maben Meyers algorithm intro by Robert Sedgwick.
Piyush M –
This is very nice course and I learned various things in this course.
Kishor K P –
Learned a lot in the class. It was really excellent. But many a times we need to hear twice to understand some of the concepts clearly.
Lie C –
a little hard
Henry R –
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 –
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.
Vlad N –
Awesome explanations and challenging problems like in all previous courses! Thank you!
Ananth N –
Really great course covering material that is not usually covered in algorithms courses, which is fantastic! The only feedback I have is that in some of the videos (the later ones on Burrows Wheeler), the material is covered extremely fast. I had to look at a lot of external resources because it was too fast. As for the programming assignments and other material, absolutely brilliant. I learnt a lot and I am planning to do another course in the specialization.
To P H –
some long and complex episode needs more specific examples to help learner visualise
Sarath C –
good course
DENIS K –
I think it would be more helpful to trade BWT to more practical Polynomial Hashing tricks. Otherwise good course
Andrey K –
There are some too hard algorithms to implement, but it worth it. It allows to develop patience, mental skills and self education. I highly recommend this course, some algorithms described here are crucial for computer science and must have to know.
Jonathan O –
This course was not my favorite in the Specialization the content just wasn’t as interesting, making some of the more demanding problems pretty difficult, but nothing was too difficult, given the excellent preparation delivered via the lectures. Everything you need to know for a problem was given right before! Still, amazing course.
Priyansh B –
I still can’t believe that there can be so many algorithms on string pattern matching. Lots of interview questions are based on string algorithms and the I believe that the skills I got from this course is definitely going to help to crack interviews in the future.Moreover, I can implement an efficient search engine efficiently.
Eduardo M P –
I would be interesting update Algorihm on Strings to construction of suffix arrays in linear time.
Sharan S M –
This was a good course. I mostly understood most of the content
Antonio –
It was awesome. I was very surprised and mesmerized while understanding how the great scientists solved these challenging problems!
Arpit V –
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.
Hidetake T –
necessary experience
Ilya E –
Sometimes explanations in lectures are hardly understandable and examples are not very descriptive. I had search more clear explanation by himself.
Chitrang S –
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.
Yaniv B Z –
Great course, and part of a great specialization. Lesson are well constructed, and the assignments reflect the lectures very well.
SAHADEVAREDDY A S –
Need to be explained more nicely
Rishikesh C –
Great content and detailed explanation
Adel F –
Takes your understanding of string algorithms to the next level and gives you new ideas of handling large amount of memory intensive tasks.
sudheer n D –
Complexity of this course is a little high compared to other courses of this specialization if you look at the course content, but you won’t feel like so when you are doing the course because of the magic of Michael Levin and Pavel Pezner. They have made it very easy to understand the basics of each and every algorithm presented through this course.
mbishibishi e –
I like the way this course walks through pattern matching step by step. One way of effectively taking the courses in this specialization is to solve a fraction of the assignments in each week, then move on and do the same for the a few following weeks, then after you’ve reached to a few weeks ahead, return to solve the rest you haven’t solved. This way, you will be able to revise what you learned in the past weeks and revisiting them will reinforce the material in your brain. The instructors did a great job preparing real programming challenges!
Tuan N –
The professor explained clearly as usual. The first 3 weeks is not too hard but final week took me really long time to understand.
Elvis C –
Interesting course!
Nate R –
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!
Saruar M –
Great course with great content. However the video explanations could be better. It is hard to truly understand the concept through the videos. I just watched the videos to serve as a “roadmap” and to really understand the topics you’d have to read the chapters from the books listed in their reading section. Still a good course overall and homework assignments are great.
Praveer D –
KMP Algorithm not explained well. Initial few lectures on BWT were very fast.
Karthik R –
The lectures are excellent. However, with reference to the logistics, it would really make sense provide test cases that are run. At least, the test cases should be made available once the student completes the assignment. By looking at the test cases, students can understand better with reference to developing better test cases in the future.
YANGXIAOKANG L –
The explanation is very clear