Learning directed acyclic graphs from large-scale genomics data

In this paper, we consider the problem of learning the genetic interaction map, i.e., the topology of a directed acyclic graph (DAG) of genetic interactions from noisy double-knockout (DK) data. Based on a set of well-established biological interaction models, we detect and classify the interactions...

Descripción completa

Detalles Bibliográficos
Autores principales: Nikolay, Fabio, Pesavento, Marius, Kritikos, George, Typas, Nassos
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer International Publishing 2017
Materias:
Research
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5607220/
https://www.ncbi.nlm.nih.gov/pubmed/28933027
http://dx.doi.org/10.1186/s13637-017-0063-3

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5607220/
https://www.ncbi.nlm.nih.gov/pubmed/28933027
http://dx.doi.org/10.1186/s13637-017-0063-3

Ejemplares similares