A Boolean Algebra for Genetic Variants
Genomics
2023-01-04 v2 Data Structures and Algorithms
Abstract
Beyond identifying genetic variants, we introduce a set of Boolean relations that allows for a comprehensive classification of the relations for every pair of variants by taking all minimal alignments into account. We present an efficient algorithm to compute these relations, including a novel way of efficiently computing all minimal alignments within the best theoretical complexity bounds. We show that for variants of the CFTR gene in dbSNP these relations are common and many non-trivial. Ultimately, we present an approach for the storing and indexing of variants in the context of a database that enables efficient querying for all these relations.
Cite
@article{arxiv.2112.14494,
title = {A Boolean Algebra for Genetic Variants},
author = {Jonathan K. Vis and Mark A. Santcroos and Walter A. Kosters and Jeroen F. J. Laros},
journal= {arXiv preprint arXiv:2112.14494},
year = {2023}
}
Comments
20 pages, 6 figures