Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Ollikainen, Jukka | Juhola, Martti; *
Affiliations: Department of Computer Sciences, 33014 University of Tampere, Tampere, Finland
Correspondence: [*] Corresponding author: Tel.: +358 3 35517972; Fax: +358 3 35516070; E-mail: [email protected].
Abstract: We examined an identifier matching problem, where an identifier corresponds to pieces of information extracted from DNA samples associated with crime suspects or victims of accidents. Such a sample is matched to cases of a database in order to identify a person. The data we used had been encoded as integers of relevantly small intervals. We solved the identifier matching task by sorting the data and then making comparisons for a maximally reduced subset of data produced by sorting. We first constructed a simple baseline method with exhaustive search, its optimised version and compared their results to those of the sort-based method, which was superior to the former two.
Keywords: DNA data, DNA identification of persons, comparison of DNA identifiers
DOI: 10.3233/IDA-2008-12407
Journal: Intelligent Data Analysis, vol. 12, no. 4, pp. 409-423, 2008
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]