estimation of recombination rates between short tandem repeats (STRs) or other polymorphisms (SNP/indels) along the X chromosome
Project description
RECOMBULATOR-X
recombulator-x is a Python module and command line tool for computing the recombination rates between short tandem repeats (STRs) markers along the X chromosome starting from pedigree data in forensic genetics.
:open_book: Documentation website
:page_facing_up: Please cite Paper
recombulator-x is written in Python (3.7) and can be used either as a module or as a command-line tool. It is the first open source implementation of the estimation method introduced in Nothnagel et al., 2012, which is the gold-standard for the estimation of recombination rates for X-chromosomal markers. We designed recombulator-x to solve some practical issues with the original R implementation. Its main advantages are:
- performance: much faster than the original implementation, thanks to algorithmic improvements (dynamic programming)
- open source: full source code and documentation available from github
- input parsing: reads pedigree data in standard (PED) format
- user friendly: easy installation (via pip) and usage with a simple command-line tool
We thank Prof. Michael Nothnagel for kindly sharing the original R implementation with us, which was an important reference for the development.
:open_book: Documentation
Full documentation is available online at the :open_book: dedicated website, or in this repository under docs
.
:wrench: Installation
You can install recombulator-x via the pip command from the standard PyPI repository:
pip install recombulator-x
:mortar_board: Overview
STRs located on the X chromosome are a valuable resource for solving complex kinship cases in forensic genetics thanks to their peculiar inheritance mode. At the same time, the usage of multiple markers linked along the same chromosome, while increasing the evidential weight, also requires proper consideration of the recombination rates between markers in the biostatistical evaluation of kinship.
For more details on X-STR kinship analyses in forensic see Gomes et al., 2020 and Tillmar et al., 2017.
In the case of forensic X-STRs, recombination rates have been either inferred from population samples through high-density multi-point single nucleotide polymorphism (SNP) data or directly estimated in large pedigree-based studies.
The main statistical approach for the estimation of recombination rates from pedigrees computes the likelihood of kinship by taking into account all possible recombinations within the maternal haplotype, thus resorting to the exponential complexity of the underlying algorithm (see Nothnagel et al., 2012 for a thorough description of the likelihood computation). Despite a computational update in C++ allowing multi-core parallelization, this approach is expected to be unsuitable when panels of more than 15 X-STRs are considered (Diegoli et al., 2016).
We developed recombulator-x to overcome this issue. Built upon the same statistical framework of the previous work (Nothnagel et al., 2012), recombulator-x uses a new computational strategy to infer recombination rates for X-STRs, while taking also the probability of mutation into account.
:boom: Additional features
- Data consistency checks
- Automatic family preprocessing and informative family extraction
- Multiple likelihood implementations included
- Accelerated likelihood computation with the JIT Python compiler Numba
- Mutation rates can be estimated for each marker separately or as a unique parameter
- Simulation of pedigrees typed with STRs
:rocket: Benchmark
recombulator-x far exceeds the computational speed of the previous approach and it is scalable to many more markers.
Indeed, performance has been the main focus of recombulator-x: in a test with simulated data of the same size as the two previous works, the time necessary for the likelihood computation of a single family drops from "several months" on 32 cores of a HPC node for the previous approach to 20 minutes on a single core with recombulator-x. This is due to algorithmic improvement time complexity going from exponential to linear with our approach. Conversely, even though the algorithm time complexity is still exponential for type II families, the speed improvement is substantial with respect to the the previous implementation.
:computer: Usage
recombulator-x uses the PED files based on PLINK pedigree files as input. The PED file format stores sample pedigree information (i.e., the familial relationships between samples) and the genotypes. More information on the input file can be found in this repository under docs/3_usage.md
.
The program can be used both as a Python module or a command-line tool. A detailed notebook for the Python module can be found here.
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
File details
Details for the file recombulator-x-1.1.0.tar.gz
.
File metadata
- Download URL: recombulator-x-1.1.0.tar.gz
- Upload date:
- Size: 21.9 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/4.0.2 CPython/3.10.9
File hashes
Algorithm | Hash digest | |
---|---|---|
SHA256 | 0edb12a2d594874c9e310c470a14d19685df284581b64d983e347dca8889efb5 |
|
MD5 | 7b50e2d03b4b0ca71fe6cd692a74d24d |
|
BLAKE2b-256 | 0656fa3c71f5a2eb553323ce3d74096ead1637c5d0a847a09505b4434f7195ee |
File details
Details for the file recombulator_x-1.1.0-py3-none-any.whl
.
File metadata
- Download URL: recombulator_x-1.1.0-py3-none-any.whl
- Upload date:
- Size: 24.7 kB
- Tags: Python 3
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/4.0.2 CPython/3.10.9
File hashes
Algorithm | Hash digest | |
---|---|---|
SHA256 | 985a5aff6637ed398d71686871823e1025413d835e45fb33d238349294ccaee4 |
|
MD5 | 6cb6bdcb0d4e44b8c74351712cb1a3b9 |
|
BLAKE2b-256 | a67c83852f2290a866d475df378230898b7a3b1870c08ab1d611e885c520f4d9 |