Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Excap: maximization of haplotypic diversity of linked markers.
Kungliga Tekniska Högskolan.
Kungliga Tekniska Högskolan.
Kungliga Tekniska Högskolan.
Stockholm University, Faculty of Science, Numerical Analysis and Computer Science (NADA).ORCID iD: 0000-0001-5341-1733
2013 (English)In: PLoS One, ISSN 1932-6203, Vol. 8, no 11, e79012- p.Article in journal (Refereed) Published
Abstract [en]

Genetic markers, defined as variable regions of DNA, can be utilized for distinguishing individuals or populations. As long as markers are independent, it is easy to combine the information they provide. For nonrecombinant sequences like mtDNA, choosing the right set of markers for forensic applications can be difficult and requires careful consideration. In particular, one wants to maximize the utility of the markers. Until now, this has mainly been done by hand. We propose an algorithm that finds the most informative subset of a set of markers. The algorithm uses a depth first search combined with a branch-and-bound approach. Since the worst case complexity is exponential, we also propose some data-reduction techniques and a heuristic. We implemented the algorithm and applied it to two forensic caseworks using mitochondrial DNA, which resulted in marker sets with significantly improved haplotypic diversity compared to previous suggestions. Additionally, we evaluated the quality of the estimation with an artificial dataset of mtDNA. The heuristic is shown to provide extensive speedup at little cost in accuracy.

Place, publisher, year, edition, pages
2013. Vol. 8, no 11, e79012- p.
National Category
Bioinformatics (Computational Biology)
Identifiers
URN: urn:nbn:se:su:diva-97256DOI: 10.1371/journal.pone.0079012ISI: 000327162900030PubMedID: 24244403OAI: oai:DiVA.org:su-97256DiVA: diva2:676298
Funder
Swedish e‐Science Research Center
Note

AuthorCount: 4;

Funding Agencies:

Foundation of German Business (Stiftung der Deutschen Wirtschaft, SDW);

Knuth and Alice Wallenberg Foundation 

Available from: 2013-12-05 Created: 2013-12-05 Last updated: 2014-01-13Bibliographically approved

Open Access in DiVA

fulltext(744 kB)73 downloads
File information
File name FULLTEXT01.pdfFile size 744 kBChecksum SHA-512
f2930c41b9172d60eb976a9845e7a4718b873347b1affaf653a08e50362d256e46ae8d722017597c362b3b3a10b059a6943212e47f2fc28040600de8942243f5
Type fulltextMimetype application/pdf

Other links

Publisher's full textPubMed

Search in DiVA

By author/editor
Arvestad, Lars
By organisation
Numerical Analysis and Computer Science (NADA)
Bioinformatics (Computational Biology)

Search outside of DiVA

GoogleGoogle Scholar
Total: 73 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
pubmed
urn-nbn

Altmetric score

doi
pubmed
urn-nbn
Total: 50 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf