Some problems of optimal alignment procedures to measure the agreement between sequences are discussed. Hidden Markov models may be a new approach that is especially suited for grouping sequences that are more or less alike.
Dijkstra, Wil
. 1994. “SEQUENCE—A Program for Analysing Sequential Data.”Bulletin de Méthodologie Sociologique43:134-142.
3.
Dijkstra, Wil
. 1999. “A New Method for Studying Verbal Interactions in Survey-Interviews.”Journal of Official Statistics15:67-85.
4.
Dijkstra, Wil
and Toon Taris. 1995. “Measuring the Agreement Between Sequences.”Sociological Methods & Research24 (2): 214-231.
5.
Eddy, Sean R.1998. “Profile Hidden Markov Models.”Bioinformatics14:755-763.
6.
Krogh, Anders
. 1998. “An Introduction to Hidden Markov Models for Biological Sequences.” Pp. 45-63 in Computational Methods in Molecular Biology, edited by Steven L. Salzberg, David B. Searls, and Simon Kasif. Amsterdam, the Netherlands: Elsevier.
7.
Smyth, Pahdraic
. 1997. “Clustering Sequences With Hidden Markov Models.” Pp. 648-654 in Advances in Neural Information Processing Vol. 9, edited by Michael C. Mozer, Michael I. Jordan, and Thomas Petsche. Cambridge, MA: MIT Press.
8.
Van Driel, Kees
, and Paul Oosterveld. 2001. “Nonoptimal Alignment: A Comment on `Measuring the Agreement Between Sequences' by Dijkstra and Taris.”Sociological Methods & Research29:524-531.
