A Clustering Algorithm Using DNA Marker Information for Sub-Pedigree Reconstruction

    Volume 48, Issue 6 (November 2003)

    ISSN: 0022-1198

    CODEN: JFSOAD

    Published Online: 1 May 2003

    Page Count: 10


    Abstract

    In a mass disaster scenario in which many people are dead, it may be that small family groups are among the dead, and investigators may need to identify such groups, e.g., to return bodies to living relatives for burial. We consider the problem of identifying small groups of closely related people within a large group of people through the use of DNA marker information. We propose a likelihood-ratio-based distance measure of the relatedness between pairs of individuals and use an estimate of this measure as a means of clustering related people into groups. We show the effectiveness of our approach on real examples and through simulations, which suggest that the method is quite reliable for identifying very close relationships. We discuss the use of our clustering algorithm in a two-stage pedigree reconstruction procedure and suggest directions in which the analysis could be extended. Applications include the identification of family groups among bodies found in mass graves and identification of family groups in animal populations.


    Paper ID: JFS2003029

    DOI: 10.1520/JFS2003029

    ASTM International
    is a member of CrossRef.

    Author
    Title A Clustering Algorithm Using DNA Marker Information for Sub-Pedigree Reconstruction
    Symposium , 0000-00-00
    Committee E30