Aristotle spent time in Athens.
In computer science , the string-to-string correction problem refers to determining the minimum number of edit operations necessary to change one string into another -LRB- i.e. , computing the shortest edit distance -RRB- .. computer science. computer science. string. String ( computer science ). edit distance. edit distance. distance. Hamming distance. A single edit operation may be changing a single symbol of the string into another , deleting , or inserting a symbol .. string. String ( computer science ). symbol. Character ( computing ). The length of the edit sequence provides a measure of the distance between the two strings .. distance. Hamming distance. Several algorithms exist to provide an efficient way to determine string distance and specify the minimum number of transformation operations required .. string. String ( computer science ). distance. Hamming distance. Such algorithms are particularly useful for delta creation operations where something is stored as a set of differences relative to a base version .. delta. Delta encoding. This allows several versions of a single object to be stored much more efficiently than storing them separately .. This holds true even for single versions of several objects if they do not differ greatly , or anything in between .. Notably , such difference algorithms are used in molecular biology to provide some measure of kinship between different kinds of organisms based on the similarities of their macromolecules -LRB- such as proteins or DNA -RRB- .. molecular biology. molecular biology. DNA. DNA