MedElevator Войти в исследования
← Поиск публикаций

DOI 10.1093/bioinformatics/btag677

Медицинская библиотека · Bioinformatics (Oxford, England) · 2026

BLOBFISH: bipartite limited subnetworks from multiple observations using breadth-first search with constrained hops.

Eicher Tara, Ben Guebila Marouen, Quackenbush John

СтатьяПеревод в очереди

Аннотация

MOTIVATION: In analyzing biological network models, such as gene regulatory networks, a common question is how members of a particular set of genes are connected. For example, one might want to explore network relationships between a set of differentially expressed genes, a gene set previously reported in the literature, or elements of one or more pathways. BLOBFISH uses a breadth-first search algorithm adapted to bipartite graphs to identify a compact subnetwork connecting the members of a pre-specified set of genes, providing a regulatory context that can shed light on specific mechanisms involved in a phenotype and its development.

RESULTS

We demonstrate the use of BLOBFISH to extract connected subnetworks between candidate nodes in and gene regulatory and eQTL networks reflecting tissue specificity using publicly available data from the Genotype Tissue Expression (GTEx) project.

AVAILABILITY: Source code is available from GR as part of the netZooR R package (v1.6) (https://github.com/netZoo/netZooR). Replication scripts are available from https://github.com/QuackenbushLab/BLOBFISH_paper_scripts. eQTL networks are available from Zenodo (doi: 10.5281/zenodo.20820178). LIONESS networks are available from GRAND (https://grand.networkmedicine.org/tissues/).

Для цитирования: Eicher Tara, Ben Guebila Marouen, Quackenbush John. BLOBFISH: bipartite limited subnetworks from multiple observations using breadth-first search with constrained hops.. Bioinformatics (Oxford, England). 2026. DOI: 10.1093/bioinformatics/btag677.

Предметные рубрики MeSH

Подготовка и перевод публикации
Обработка статьи · этапы, ошибки и управление
Загрузка состояния…

История · было → стало

Состояние обновляется каждые 5 секунд, пока блок открыт. Процент показывается только там, где известен объём работы. Пауза останавливает продолжение этапа; текущий запрос к источнику может завершиться.

Тип публикации указан по данным источника. Уровень доказательности автоматически не присваивается.