Format

Send to

Choose Destination
Bioinformatics. 2018 Nov 1;34(21):3719-3726. doi: 10.1093/bioinformatics/bty401.

EBIC: an evolutionary-based parallel biclustering algorithm for pattern discovery.

Author information

1
Institute for Biomedical Informatics, University of Pennsylvania, Philadelphia, PA, USA.
2
Department of Automatics and Biomedical Engineering, AGH University of Science and Technology, Krakow, Poland.
3
Department of Computer Science, Ben-Gurion University, Beer Sheva, Israel.
4
Department of Computer Science, Arkansas State University, Jonesboro, AR, USA.

Abstract

Motivation:

Biclustering algorithms are commonly used for gene expression data analysis. However, accurate identification of meaningful structures is very challenging and state-of-the-art methods are incapable of discovering with high accuracy different patterns of high biological relevance.

Results:

In this paper, a novel biclustering algorithm based on evolutionary computation, a sub-field of artificial intelligence, is introduced. The method called EBIC aims to detect order-preserving patterns in complex data. EBIC is capable of discovering multiple complex patterns with unprecedented accuracy in real gene expression datasets. It is also one of the very few biclustering methods designed for parallel environments with multiple graphics processing units. We demonstrate that EBIC greatly outperforms state-of-the-art biclustering methods, in terms of recovery and relevance, on both synthetic and genetic datasets. EBIC also yields results over 12 times faster than the most accurate reference algorithms.

Availability and implementation:

EBIC source code is available on GitHub at https://github.com/EpistasisLab/ebic.

Supplementary information:

Supplementary data are available at Bioinformatics online.

PMID:
29790909
PMCID:
PMC6198864
[Available on 2019-11-01]
DOI:
10.1093/bioinformatics/bty401

Supplemental Content

Full text links

Icon for Silverchair Information Systems
Loading ...
Support Center