A Boolean algebra for genetic variants
Bioinformatics, vol. 39
Abstract
MOTIVATION: Beyond identifying genetic variants, we introduce a set of Boolean relations, which allows for a comprehensive classification of the relations of 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. RESULTS: We show that these relations are common, and many non-trivial, for variants of the CFTR gene in dbSNP. 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. AVAILABILITY AND IMPLEMENTATION: A Python implementation is available at https://github.com/mutalyzer/algebra/tree/v0.2.0 as well as an interface at https://mutalyzer.nl/algebra.
Authors 4
-
Jonathan K. Vis corresponding Aachen Department of Human Genetics Leiden Institute of Advanced Computer Science
Leiden University · Leiden University Medical Center
Affiliation as printed
Department of Human Genetics, Leiden University Medical Center , 2333 ZC Leiden, The Netherlands
Leiden Institute of Advanced Computer Science, Leiden University , 2333 CA Leiden, The Netherlands
-
Leiden University Medical Center
Affiliation as printed
Department of Clinical Genetics, Leiden University Medical Center , 2333 ZC Leiden, The Netherlands
Department of Human Genetics, Leiden University Medical Center , 2333 ZC Leiden, The Netherlands
-
Affiliation as printed
Leiden Institute of Advanced Computer Science, Leiden University , 2333 CA Leiden, The Netherlands
-
Leiden University Medical Center · National Institute for Public Health and the Environment
Affiliation as printed
Department of Human Genetics, Leiden University Medical Center , 2333 ZC Leiden, The Netherlands
National Institute for Public Health and the Environment (RIVM) , 3721 MA Bilthoven, The Netherlands
Cited by 1 stored of 1
1 result
No patents citing this paper on Lens.org (checked 2026-10-11).