-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathREADME
More file actions
28 lines (17 loc) · 687 Bytes
/
Copy pathREADME
File metadata and controls
28 lines (17 loc) · 687 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
LCS: Longest Common Subsequence
===============================
Various implementations of the LCS algorithms described by Thomas Guest:
http://wordaligned.org/articles/longest-common-subsequence
The Algorithms
--------------
There are four algorithms:
- recursive: Easiest to understand but least efficient.
- memoized: A memoized version of the "recursive" algorithm.
- grid: Dynamic programming solution.
- hirschberg: Another algorithm, developed by some dude named Hirschberg.
Thomas Guest
------------
Verbatim implementations of the code in the original blog post.
Pandas
------
I reimplement Guest's algorithms with pandas data structures. This is the cutest version.