Optimal strategies for familial searching

Maarten Kruijver; Ronald Meester; Klaas Slooten; R.W.J. Meester

doi:10.1016/j.fsigen.2014.06.010

Optimal strategies for familial searching

Maarten Kruijver, Ronald Meester, Klaas Slooten, R.W.J. Meester

Mathematics

Research output: Contribution to Journal › Article › Academic › peer-review

Abstract

Familial searching is the process of finding potential relatives of the donor of a crime scene profile in a DNA database. Several authors have proposed strategies for generating candidate lists of potential relatives. This paper reviews four strategies and investigates theoretical properties as well as empirical behavior, using a comprehensive simulation study on mock databases. The effectiveness of a familial search is shown to highly depend on the case profile as well as on the tuning parameters. We give recommendations for proceeding in an optimal way and on how to choose tuning parameters both in general and on a case-by-case basis. Additionally we treat searching heterogeneous databases (not all profiles comprise the same loci) and composite searching for multiple types of kinship. An R-package for reproducing results in a particular case is released to help decision-making in familial searching. © 2014 Elsevier Ireland Ltd.

Original language	English
Pages (from-to)	90-103
Number of pages	14
Journal	Forensic Science International: Genetics
Volume	13
DOIs	https://doi.org/10.1016/j.fsigen.2014.06.010
Publication status	Published - 2014

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1016/j.fsigen.2014.06.010

http://www.mendeley.com/research/optimal-strategies-familial-searching

Persistent URL (handle)

Persistent link

Cite this

@article{6222b8cde6924757b13ca48035f83a8a,

title = "Optimal strategies for familial searching",

abstract = "Familial searching is the process of finding potential relatives of the donor of a crime scene profile in a DNA database. Several authors have proposed strategies for generating candidate lists of potential relatives. This paper reviews four strategies and investigates theoretical properties as well as empirical behavior, using a comprehensive simulation study on mock databases. The effectiveness of a familial search is shown to highly depend on the case profile as well as on the tuning parameters. We give recommendations for proceeding in an optimal way and on how to choose tuning parameters both in general and on a case-by-case basis. Additionally we treat searching heterogeneous databases (not all profiles comprise the same loci) and composite searching for multiple types of kinship. An R-package for reproducing results in a particular case is released to help decision-making in familial searching. {\textcopyright} 2014 Elsevier Ireland Ltd.",

author = "Maarten Kruijver and Ronald Meester and Klaas Slooten and R.W.J. Meester",

year = "2014",

doi = "10.1016/j.fsigen.2014.06.010",

language = "English",

volume = "13",

pages = "90--103",

journal = "Forensic Science International: Genetics",

issn = "1872-4973",

publisher = "Elsevier Ireland Ltd",

}

TY - JOUR

T1 - Optimal strategies for familial searching

AU - Kruijver, Maarten

AU - Meester, Ronald

AU - Slooten, Klaas

AU - Meester, R.W.J.

PY - 2014

Y1 - 2014

N2 - Familial searching is the process of finding potential relatives of the donor of a crime scene profile in a DNA database. Several authors have proposed strategies for generating candidate lists of potential relatives. This paper reviews four strategies and investigates theoretical properties as well as empirical behavior, using a comprehensive simulation study on mock databases. The effectiveness of a familial search is shown to highly depend on the case profile as well as on the tuning parameters. We give recommendations for proceeding in an optimal way and on how to choose tuning parameters both in general and on a case-by-case basis. Additionally we treat searching heterogeneous databases (not all profiles comprise the same loci) and composite searching for multiple types of kinship. An R-package for reproducing results in a particular case is released to help decision-making in familial searching. © 2014 Elsevier Ireland Ltd.

AB - Familial searching is the process of finding potential relatives of the donor of a crime scene profile in a DNA database. Several authors have proposed strategies for generating candidate lists of potential relatives. This paper reviews four strategies and investigates theoretical properties as well as empirical behavior, using a comprehensive simulation study on mock databases. The effectiveness of a familial search is shown to highly depend on the case profile as well as on the tuning parameters. We give recommendations for proceeding in an optimal way and on how to choose tuning parameters both in general and on a case-by-case basis. Additionally we treat searching heterogeneous databases (not all profiles comprise the same loci) and composite searching for multiple types of kinship. An R-package for reproducing results in a particular case is released to help decision-making in familial searching. © 2014 Elsevier Ireland Ltd.

U2 - 10.1016/j.fsigen.2014.06.010

DO - 10.1016/j.fsigen.2014.06.010

M3 - Article

C2 - 25082141

SN - 1872-4973

VL - 13

SP - 90

EP - 103

JO - Forensic Science International: Genetics

JF - Forensic Science International: Genetics

ER -

Optimal strategies for familial searching

Abstract

UN SDGs

Access to Document

Persistent URL (handle)

Fingerprint

Cite this