An algorithm to measure agreement between sequences as proposed by Dijkstra and Taris is discussed. It is concluded that the “optimal alignment” algorithm does not necessarily produce the optimal solution, that is, the minimal distance between two sequences.
Get full access to this article
View all access options for this article.
References
1.
Abbott, Andrew
. 1990. “A Primer on Sequential Methods.”Organization Science1:375-392.
2.
Abbott, Andrew
. 1995a. “Sequence Analysis: New Methods for Old Ideas.”Annual Review of Sociology21:93-113.
3.
Abbott, Andrew
. 1995b. “A Comment on `Measuring the Agreement Between Sequences.' ”Sociological Methods & Research24:232-243.
4.
Abbott, Andrew
and Alexandra Hrycak. 1990. “Measuring Resemblance in Sequence Data: An Optimal Matching Analysis of Musicians' Careers.”American Journal of Sociology96:144-185.
5.
Dijkstra, Wil
. 1994. “SEQUENCE: A Program for Analysing Sequential Data.”Bulletin de Méthodologie Sociologique43:134-142.
6.
Dijkstra, Wil
and Toon Taris. 1995. “Measuring the Agreement Between Sequences.”Sociological Methods & Research24:214-231.
7.
Kruskal, Joseph B.
1983. “An Overview of Sequence Comparison.” Pp. 1-44 in Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, edited by David Sankoff and Joseph B. Kruskal. Reading, MA: Addison-Wesley.
8.
Lowrance, Roy
and Robert A. Wagner. 1975. “An Extension of the String-to-String Correction Problem.”Journal of the Association for Computing Machinery22:177-183.
9.
Wagner, Robert A.
1983. “On the Complexity of the Extended String-to-String Correction Problem.” Pp. 211-214 in Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, edited by David Sankoff and Joseph B. Kruskal. Reading, MA: Addison-Wesley.
10.
Wagner, Robert A.
and Michael J. Fischer. 1974. “The String-to-String Correction Problem.”Journal of the Association for Computing Machinery21:168-173.
