Show simple item record

dc.contributor.authorWilliams, Lucia
dc.contributor.authorMumey, Brendan
dc.date.accessioned2021-09-17T16:02:26Z
dc.date.available2021-09-17T16:02:26Z
dc.date.issued2020-05
dc.identifier.citationWilliams, Lucia, and Brendan Mumey. “Maximal Perfect Haplotype Blocks with Wildcards.” iScience 23, no. 6 (June 2020): 101149. doi:10.1016/j.isci.2020.101149.en_US
dc.identifier.issn2589-0042
dc.identifier.urihttps://scholarworks.montana.edu/xmlui/handle/1/16450
dc.description.abstractRecent work provides the first method to measure the relative fitness of genomic variants within a population that scales to large numbers of genomes. A key component of the computation involves finding maximal perfect haplotype blocks from a set of genomic samples for which SNPs (single-nucleotide polymorphisms) have been called. Often, owing to low read coverage and imperfect assemblies, some of the SNP calls can be missing from some of the samples. In this work, we consider the problem of finding maximal perfect haplotype blocks where some missing values may be present. Missing values are treated as wildcards, and the definition of maximal perfect haplotype blocks is extended in a natural way. We provide an output-linear time algorithm to identify all such blocks and demonstrate the algorithm on a large population SNP dataset. Our software is publicly available.en_US
dc.language.isoen_USen_US
dc.rights© This final published version is made available under the CC-BY-NC-ND 4.0 license.en_US
dc.rights.urihttps://creativecommons.org/licenses/by-nc-nd/4.0/en_US
dc.titleMaximal Perfect Haplotype Blocks with Wildcardsen_US
dc.typeArticleen_US
mus.citation.extentfirstpage101149en_US
mus.citation.issue6en_US
mus.citation.journaltitleiScienceen_US
mus.citation.volume23en_US
mus.identifier.doi10.1016/j.isci.2020.101149en_US
mus.relation.collegeCollege of Engineeringen_US
mus.relation.departmentComputer Science.en_US
mus.relation.universityMontana State University - Bozemanen_US
mus.data.thumbpage1en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

© This final published version is made available under the CC-BY-NC-ND 4.0 license.
Except where otherwise noted, this item's license is described as © This final published version is made available under the CC-BY-NC-ND 4.0 license.

MSU uses DSpace software, copyright © 2002-2017  Duraspace. For library collections that are not accessible, we are committed to providing reasonable accommodations and timely access to users with disabilities. For assistance, please submit an accessibility request for library material.