research-project: Clarify memory algorithm option

research-project/index.md

@@ -80,7 +80,7 @@ Efficient use of contiguous memory structures such as arrays are critical to hig
 1. [Bloom filters](https://www.jasondavies.com/bloomfilter/) ([Stanford lecture notes](https://web.stanford.edu/class/archive/cs/cs106b/cs106b.1206/lectures/esoteric-data-structures/#bloom-filters))
 1. [Suffix arrays](https://www.algorist.com/problems/Suffix_Trees_and_Arrays.html) ([UCSD lecture video](https://youtu.be/IzMxbboPcqQ))
 
-Some familiarity with the concept of bits and bytes may help with understanding.
+Some familiarity with the concept of bits and bytes may help with understanding. For Swiss tables and Bloom filters, compare them against the standard `java.util.Set` implementations. For suffix arrays, compare them against the [DNA Indexing]({{ site.baseurl }}{% link dna-indexing/index.md %}) implementations.
 
 ### Algorithms for your existing research