The optimal matching (OM) algorithm is widely used for sequence analysis in sociology. It has a natural interpretation for discrete-time sequences but is also widely used for life-history data, which are continuous in time. Life-history data are arguably better dealt with in terms of episodes rather than as strings of time-unit observations, and in this article, the author examines whether the OM algorithm is unsuitable for such sequences. A modified version of the algorithm is proposed, weighting OM's elementary operations inversely with episode length. In the general case, the modified algorithm produces pairwise distances much lower than the standard algorithm, the more the sequences are composed of long spells in the same state. However, where all the sequences in a data set consist of few long spells, and there is low variability in the number of spells, the modified algorithm generates an overall pattern of distances that is not very different from standard OM.