Figure 1.

Example of the Levenshtein distance algorithm; the algorithm counts the minimum number of insertions and deletions of letters required to make the observed pathway equal to a reference pathway; three changes were required to transform the patient pathway (A–F–B–F) into the reference pathway (A–B–C).