EBIC.JL -- an Efficient Implementation of Evolutionary Biclustering Algorithm in Julia
Not on the map. Why?
Abstract (arXiv)
Biclustering is a data mining technique which searches for local patterns in numeric tabular data with main application in bioinformatics. This technique has shown promise in multiple areas, including development of biomarkers for cancer, disease subtype identification, or gene-drug interactions among others. In this paper we introduce EBIC.JL - an implementation of one of the most accurate biclustering algorithms in Julia, a modern highly parallelizable programming language for data science. We show that the new version maintains comparable accuracy to its predecessor EBIC while converging faster for the majority of the problems. We hope that this open source software in a high-level programming language will foster research in this promising field of bioinformatics and expedite development of new biclustering methods for big data.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 10 of its 62 references that are in the map. First posted on arXiv 3 May 2021.
Builds on
10 of 62 references.
References · 10
- 2017Evolving Deep Neural Networkscited by 93
- 2018Fashionable Modelling with Fluxcited by 53
- 2018Where are we now? A large benchmark study of recent symbolic regression methodscited by 44
- 2019Epsilon-Lexicase Selection for Regressioncited by 31
- 2016Automating biomedical data science through tree-based pipeline optimizationcited by 21
- 2017Effective Extensible Programming: Unleashing Julia on GPUscited by 16
- 2020MLJ: A Julia package for composable machine learningcited by 9
- 2017Evolving Unsupervised Deep Neural Networks for Learning Meaningful Representationscited by 4
- 2018EBIC: an evolutionary-based parallel biclustering algorithm for pattern discovercited by 1
- 2018EBIC: an open source software for high-dimensional and big data biclustering analysescited by 1
Built on by
Not cited yet.