**Distances between discrete mathematical
structures**

**Problems with old approaches:**

- Minimum number of transformations.
- Largest substructure: ignores all else
- Smallest superstructure: makes sense for some types of objects more than others

**New**
approach:

Examples:

- Graph distances
- How to calculate string distances:

http://srufaculty.sru.edu/david.dailey/javascript/StringDistances.html

Results:

- lemmas and conjectures
- visualization

Directions:

- prove theorems
- computational complexity
- embed group theory, graph theory and string space all in a common metaspace.