TY - JOUR
T1 - Sequence similarity - a non-aligning technique
AU - Elzinga, C.H.
PY - 2003
Y1 - 2003
N2 - This article reviews objections to optimal-matching (OM) algorithms in sequence analysis and reformulates the concept of sequence similarity in terms of a binary precedence relation. This precedence relation is then used to develop a new quantification of sequence similarity. The new measure is used to reanalyze the life history data that were previously discussed by Dijkstra and Taris (1995). The reanalysis demonstrates the new measure to be superior to the OM algorithm and the alternatives proposed by Dijkstra and Taris. A new algorithm is presented to enumerate matching k-tuples from pairs of sequences in polynomial time.
AB - This article reviews objections to optimal-matching (OM) algorithms in sequence analysis and reformulates the concept of sequence similarity in terms of a binary precedence relation. This precedence relation is then used to develop a new quantification of sequence similarity. The new measure is used to reanalyze the life history data that were previously discussed by Dijkstra and Taris (1995). The reanalysis demonstrates the new measure to be superior to the OM algorithm and the alternatives proposed by Dijkstra and Taris. A new algorithm is presented to enumerate matching k-tuples from pairs of sequences in polynomial time.
UR - https://www.scopus.com/pages/publications/0042071260
UR - https://www.scopus.com/inward/citedby.url?scp=0042071260&partnerID=8YFLogxK
U2 - 10.1177/0049124103253373
DO - 10.1177/0049124103253373
M3 - Article
SN - 0049-1241
VL - 32
SP - 3
EP - 29
JO - Sociological Methods and Research
JF - Sociological Methods and Research
IS - 1
ER -