eGADA: enhanced Genomic Alteration Detection Algorithm, a fast genomic segmentation algorithm
Huang, Y. S.
Show abstract
eGADA is an enhanced version of GADA, which is a fast segmentation algorithm utilizing the Sparse Bayesian Learning (or Relevance Vector Machine) technique from Tipping 2001. It can be applied to array intensity data, NGS sequencing coverage data, or any sequential data that displays characteristics of stepwise functions. Improvements by eGADA over GADA include: a) a customized Red-Black tree to expedite the final backward elimination step of GADA; b) code in C++, which is safer and better structured than C; c) use Boost libraries extensively to provide user-friendly help and commandline argument processing; d) user-friendly input and output formats; e) export a dynamic library eGADA.so (packaged via Boost.Python) that offers API to Python; f) other bug fixes/optimization. The code is published at https://github.com/polyactis/eGADA.
Matching journals
The top 2 journals account for 50% of the predicted probability mass.
Similar papers in this journal
- SnpHub: an easy-to-set-up web server framework for exploring large-scale genomic variation data in the post-genomic era with applications in wheat 95%
- Smash++: an alignment-free and memory-efficient tool to find genomic rearrangements 95%
- CNVpytor: a tool for CNV/CNA detection and analysis from read depth and allele imbalance in whole genome sequencing 95%
"Similar papers" are the closest papers from that journal in the model's embedding space. They show what the match is built on, but the ranking comes mostly from a classifier over the whole training set, not from these examples alone.