A Transition-Oriented Approach to Optimal Matching
A Transition-Oriented Approach to Optimal Matching
复制标题
面向转换的最佳匹配方法
DOI：
--
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
Torsten Biemann
中科院分区：
文献类型：
--
作者：
Torsten Biemann
最佳匹配（OM）是一种评估序列相似性的方法。它最初是为了研究蛋白质和DNA序列而开发的，后来被转移到社会科学中，并相应地应用。然而，关于其在社会科学中的使用是否充分的争论正在进行中，因为表面的转移可能不会对生物和社会环境中典型序列之间的显着差异做出反应。在本文中，我阐述了这些差异，并介绍了两个序列类型之间的区别，即共同的祖先和展开过程。虽然第一序列类型通常存在于生物环境中（例如，DNA序列），后者适用于社会科学中研究的大多数序列（例如，职业）。基于这种区别，我提出了一种新的编码序列的方式作为传统OM分析的扩展，并在模拟和实证的例子中证明其实用性。本文最后讨论了这种新的方法，并将其集成到以前的扩展OM。
Optimal matching (OM) is a method that assesses sequence similarity. It was originally developed to study protein and DNA sequences and was later transferred to the social sciences where it was applied accordingly. However, there is an ongoing debate on the adequacy of its use in the social sciences, as a superficial transfer might not respond to the significant differences between typical sequences in biological and social settings. In this paper, I elaborate on these differences and introduce a distinction between two sequence types—namely, common ancestors and unfolding processes. While the first sequence type is typically found in biological settings (e.g., DNA sequences), the latter applies to most sequences studied in the social sciences (e.g., careers). Based on this distinction, I present a new way of coding sequences as an extension to conventional OM analyses and demonstrate its usefulness in simulated and empirical examples. The paper concludes with a discussion of this new approach and its integration into previous extensions of OM.