-The algorithm Mussa uses to find conserved sequences is sensative to
-repeated DNA segments, which are naturally apart of many genomes. The
-problem with repeats, is that one repeat from one sequence can show up
-many times in another sequence. Every connection Mussa makes takes up
-memory, and it also takes time to store and process the results.
+The algorithm Mussa uses to find conserved sequences is sensitive to
+repeated DNA segments, which are frequently occurring in most
+genomes. The problem with repeats, is that one repeat from one
+sequence can show up many times in another sequence. Every connection
+Mussa makes takes up memory and CPU time to process.