Sequence similarity - a non-aligning technique

C.H. Elzinga

    Research output: Contribution to JournalArticleAcademicpeer-review

    105 Downloads (Pure)

    Abstract

    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.
    Original languageEnglish
    Pages (from-to)3-29
    Number of pages27
    JournalSociological Methods and Research
    Volume32
    Issue number1
    DOIs
    Publication statusPublished - 2003

    Fingerprint

    Dive into the research topics of 'Sequence similarity - a non-aligning technique'. Together they form a unique fingerprint.

    Cite this