WMAXC: a weighted maximum clique method for identifying condition-specific sub-network.
Sub-networks can expose complex patterns in an entire bio-molecular network by extracting interactions that depend on temporal or condition-specific contexts. When genes interact with each other during cellular processes, they may form differential co-expression patterns with other genes across diff...
Guardado en:
Autores principales: | Bayarbaatar Amgalan, Hyunju Lee |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Public Library of Science (PLoS)
2014
|
Materias: | |
Acceso en línea: | https://doaj.org/article/87e77d52cee84432a48d08dcf61fd121 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
por: Luis Gouveia, et al.
Publicado: (2015) -
Computing cliques and cavities in networks
por: Dinghua Shi, et al.
Publicado: (2021) -
Clique of functional hubs orchestrates population bursts in developmentally regulated neural networks.
por: Stefano Luccioli, et al.
Publicado: (2014) -
Network clique cover approximation to analyze complex contagions through group interactions
por: Giulio Burgio, et al.
Publicado: (2021) -
A Restart Local Search for Solving Diversified Top-<i>k</i> Weight Clique Search Problem
por: Jun Wu, et al.
Publicado: (2021)