# Optimal matching distances

If I have two sequences:

1: A-B-C-D
1: X-A-B-C-D


and I do:

library(TraMineR)
seqdist(sequence1, sequence2, method = "OM")


Will it then compare position 1, 2, 3, 4, 5 (in the 2nd sequence) and show that each position needs to be replaced, or is it smart enough to just insert the X at the front of the 1st sequence, and then shift the other markers so as to make the two sequences equal (aligned)?

library(TraMineR)