Visual guide for the algorithm “Common Subsequence Count”

Cees Elzinga, Sven Rahmann and Hui Wang have perfectly explained several algorithms on string sequences on their paper , namely Algorithms for Subsequence Combinatorics.

Of those algorithms, I analysed the algorithm  “Counting Common Subsequence” to attack the problem Square Subsequences in HackerRank.

In order to understard the algorithm better, I prepared a visual representation of the algorithm steps in this powerpoint file. It may be a helpful visual guide for those who are struggling with the details of the algorithms.  I would like to, also, take this opportunity to thank each and everyone of the authors of the paper.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s