- Data Structures:
- Search
- Sort
- Trees
- Binary Search Tree
- Prefix Counter Trie
- Tree Edit Distance
- [Zhang-Shasha's Tree Edit Distance] (./src/main/java/me/gowdru/notes/tree/ed/ZSTEDMatrix.java), Usage
- Text
- Information Retrieval
- Vector Space Model : Simple VSM Implementation
- Math
- Puzzles and Solutions:
- 03/12/2016 : Quick Sort, Priority Queue
- 03/11/2016 : Min Heap using Complete-Trees on Arrays
- 12/20/2015 : Tree edit distance
- 11/29/2015 : Revising B-Tree
- IR Book : http://www-nlp.stanford.edu/IR-book/
- Minimum Edit Distance: https://web.stanford.edu/class/cs124/lec/med.pdf
- K. Zhang and D. Shasha. 1989. Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput. 18, 6 (December 1989), 1245-1262. DOI=http://dx.doi.org/10.1137/0218082