|
|
|
| Registros recuperados: 11 | |
|
|
| Malay Bhattacharyya; Sanghamitra Bandyopadhyay. |
| Simultaneous overexpression or underexpression of multiple genes, used in various forms as probes in the high-throughput microarray experiments, facilitates the identification of their underlying functional proximity. This kind of functional associativity (or conversely the separability) between the genes can be represented proficiently using co-expression networks. The extensive repository of diversified microarray data encounters a recent problem of multi-experimental data integration for the aforesaid purpose. This paper highlights a novel integration method of gene co-expression networks, based on the search for their consensus network, derived from diverse microarray experimental data for the purpose of clustering. The proposed methodology avoids the... |
| Tipo: Presentation |
Palavras-chave: Bioinformatics. |
| Ano: 2012 |
URL: http://precedings.nature.com/documents/7126/version/1 |
| |
|
|
| Malay Bhattacharyya; Sanghamitra Bandyopadhyay; Ujjwal Maulik. |
| We provide the first formalization true to the best of our knowledge to the problem of finding bicliques in a directed graph. The problem is addressed employing a two-stage approach based on an existing biclustering algorithm. This novel problem is useful in several biological applications of which we focus only on analyzing the viral-host protein interaction graphs. Strong and significant bicliques of HIV-1 and human proteins are derived using the proposed methodology, which provides insights into some novel regulatory functionalities in case of the acute immunodeficiency syndrome in human. |
| Tipo: Presentation |
Palavras-chave: Immunology; Bioinformatics. |
| Ano: 2012 |
URL: http://precedings.nature.com/documents/7148/version/1 |
| |
|
| |
|
| |
|
|
| Sanghamitra Bandyopadhyay; Malay Bhattacharyya. |
| A clique is a complete subgraph of a graph. Often, a clique is interpreted as a dense module of vertices within a graph. However, in many real-world situations, the classical problem of finding a clique is required to be relaxed. This motivates the problem of finding quasicliques that are almost complete subgraphs of a graph. In sparse and very large scale-free networks, the problem of finding the largest quasi-clique becomes hard to manage with the existing approaches. Here, we propose a heuristic algorithm in this paper for locating the largest quasi-clique from the human protein-protein interaction networks. The results show promise in computational biology research by the exploration of significant protein modules. |
| Tipo: Presentation |
Palavras-chave: Bioinformatics. |
| Ano: 2012 |
URL: http://precedings.nature.com/documents/7125/version/1 |
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
| Malay Bhattacharyya; Sanghamitra Bandyopadhyay. |
| MicroRNAs (miRNAs) are small endogeneous non-coding RNAs of about 22nt length. These short RNAs regulate the expression of mRNAs by hybridizing with their 3'-UTRs or by translational repression. They have been shown to take crucial roles in many biological processes. Many of the current studies are focused over how mature miRNAs regulate mRNAs, even though there is very limited knowledge about their transcriptional loci. Primary miRNAs (pri-miRs) are first transcribed from the DNA, followed by the formation of precursor miRNA (pre-miR) by endonucleases activity, which finally produces mature miRNAs. Unfortunately, the identification of the loci of pri-miRs, and the associated information about transcription start sites (TSSs) and promoters is... |
| Tipo: Manuscript |
Palavras-chave: Genetics & Genomics; Molecular Cell Biology; Bioinformatics. |
| Ano: 2012 |
URL: http://precedings.nature.com/documents/6832/version/1 |
| |
| Registros recuperados: 11 | |
|
|
|
