Analyzing Sequence Data: Optimal Matching in Management Research

Biemann, Torsten ; Datta, Deepak K.

Document Type: Article
Year of publication: 2014
The title of a journal, publication series: Organizational Research Methods : ORM
Volume: 17
Issue number: 1
Page range: 51-76
Place of publication: Thousand Oaks, Calif.
Publishing house: Sage Publications
ISSN: 1094-4281 , 1552-7425
Publication language: English
Institution: Business School > ABWL, Personalmanagement u. Führung (Biemann 2013-)
Subject: 330 Economics
Classification: JEL:
Keywords (English): optimal matching , sequence data A
Abstract: In this article we discuss optimal matching (OM), an invaluable yet underutilized tool in the analysis of sequence data. Initially developed in biology to identify and study patterns in DNA sequences, OM subsequently migrated over to sociology, where it has been used to examine career patterns in life course research. It involves the computation of the number of insertions, deletions, and substitutions of sequence elements that are needed to transform one sequence into another and the costs associated with such transformations. The goal is to identify similarities across sequences, which can then be used for pattern identification. Along with a discussion of the logic underlying OM analysis, we provide an illustration of its use in the examination of careers of deans at U.S. business schools. In addition, we use Monte Carlo simulation to compare OM and cluster analysis and highlight the superiority of OM analysis in the analysis of sequence data. Also discussed are recent methodological advances that have been made in OM and our recommendations and guidelines for future applications of OM in management research.

Dieser Eintrag ist Teil der Universitätsbibliographie.

Metadata export


+ Search Authors in

+ Page Views

Hits per month over past year

Detailed information

You have found an error? Please let us know about your desired correction here: E-Mail

Actions (login required)

Show item Show item