1"use strict";(self.webpackChunknjit_gsa=self.webpackChunknjit_gsa||[]).push([[1279],{3905:function(e,t,n){n.d(t,{Zo:function(){return u},kt:function(){return f}});var r=n(7294);function i(e,t,n){return t in e?Object.defineProperty(e,t,{value:n,enumerable:!0,configurable:!0,writable:!0}):e[t]=n,e}function o(e,t){var n=Object.keys(e);if(Object.getOwnPropertySymbols){var r=Object.getOwnPropertySymbols(e);t&&(r=r.filter((function(t){return Object.getOwnPropertyDescriptor(e,t).enumerable}))),n.push.apply(n,r)}return n}function a(e){for(var t=1;t<arguments.length;t++){var n=null!=arguments[t]?arguments[t]:{};t%2?o(Object(n),!0).forEach((function(t){i(e,t,n[t])})):Object.getOwnPropertyDescriptors?Object.defineProperties(e,Object.getOwnPropertyDescriptors(n)):o(Object(n)).forEach((function(t){Object.defineProperty(e,t,Object.getOwnPropertyDescriptor(n,t))}))}return e}function s(e,t){if(null==e)return{};var n,r,i=function(e,t){if(null==e)return{};var n,r,i={},o=Object.keys(e);for(r=0;r<o.length;r++)n=o[r],t.indexOf(n)>=0||(i[n]=e[n]);return i}(e,t);if(Object.getOwnPropertySymbols){var o=Object.getOwnPropertySymbols(e);for(r=0;r<o.length;r++)n=o[r],t.indexOf(n)>=0||Object.prototype.propertyIsEnumerable.call(e,n)&&(i[n]=e[n])}return i}var c=r.createContext({}),l=function(e){var t=r.useContext(c),n=t;return e&&(n="function"==typeof e?e(t):a(a({},t),e)),n},u=function(e){var t=l(e.components);return r.createElement(c.Provider,{value:t},e.children)},p={inlineCode:"code",wrapper:function(e){var t=e.children;return r.createElement(r.Fragment,{},t)}},d=r.forwardRef((function(e,t){var n=e.components,i=e.mdxType,o=e.originalType,c=e.parentName,u=s(e,["components","mdxType","originalType","parentName"]),d=l(n),f=i,m=d["".concat(c,".").concat(f)]||d[f]||p[f]||o;return n?r.createElement(m,a(a({ref:t},u),{},{components:n})):r.createElement(m,a({ref:t},u))}));function f(e,t){var n=arguments,i=t&&t.mdxType;if("string"==typeof e||i){var o=n.length,a=new Array(o);a[0]=d;var s={};for(var c in t)hasOwnProperty.call(t,c)&&(s[c]=t[c]);s.originalType=e,s.mdxType="string"==typeof e?e:i,a[1]=s;for(var l=2;l<o;l++)a[l]=n[l];return r.createElement.apply(null,a)}return r.createElement.apply(null,n)}d.displayName="MDXCreateElement"},8069:function(e,t,n){n.r(t),n.d(t,{frontMatter:function(){return s},contentTitle:function(){return c},metadata:function(){return l},toc:function(){return u},default:function(){return d}});var r=n(7462),i=n(3366),o=(n(7294),n(3905)),a=["components"],s={sidebar_position:15},c="014",l={unversionedId:"research-day-2019/014",id:"research-day-2019/014",isDocsHomePage:!1,title:"014",description:"Title:",source:"@site/docs/research-day-2019/014.md",sourceDirName:"research-day-2019",slug:"/research-day-2019/014",permalink:"/docs/research-day-2019/014",tags:[],version:"current",sidebarPosition:15,frontMatter:{sidebar_position:15},sidebar:"defaultSidebar",previous:{title:"013",permalink:"/docs/research-day-2019/013"},next:{title:"016",permalink:"/docs/research-day-2019/016"}},u=[{value:"Title:",id:"title",children:[]},{value:"Presenter:",id:"presenter",children:[]},{value:"Abstract:",id:"abstract",children:[]},{value:"Author(s):",id:"authors",children:[]},{value:"Funding Acknowledgements:",id:"funding-acknowledgements",children:[]}],p={toc:u};function d(e){var t=e.components,n=(0,i.Z)(e,a);return(0,o.kt)("wrapper",(0,r.Z)({},p,n,{components:t,mdxType:"MDXLayout"}),(0,o.kt)("h1",{id:"014"},"014"),(0,o.kt)("h2",{id:"title"},"Title:"),(0,o.kt)("p",null,"A novel similarity measure in gene co-expression network"),(0,o.kt)("p",null,(0,o.kt)("strong",{parentName:"p"},"Discipline:")," Systems Biology, Computer Science"),(0,o.kt)("h2",{id:"presenter"},"Presenter:"),(0,o.kt)("p",null,"Niloofar Aghaieabiane"),(0,o.kt)("h2",{id:"abstract"},"Abstract:"),(0,o.kt)("p",null,"Gene co-expression networks (GCNs) provide an effective way of modeling and studying complex biological systems. Working with GCNs involves two steps: (i) constructing the network based on measures of pairwise similarity between genes, (ii) identifying biologically meaningful modules of genes in the network (clustering). The quality of the identified modules is in principle dependent on the network construction step. Therefore, defining an appropriate measure for gene similarity has a paramount role in extracting significant biological knowledge from the networks. In this study, we propose a new method for constructing GCN networks which introduces to standard methodologies a pre-processing of the raw data, and a new measure of gene similarity based on a geometric rather than a statistical approach. When compared against the state-of-the-art methods, our approach produces highly more significant cluster
1s of genes."),(0,o.kt)("h2",{id:"authors"},"Author(s):"),(0,o.kt)("p",null,"Niloofar Aghaieabiane, Ioannis Koutis"),(0,o.kt)("h2",{id:"funding-acknowledgements"},"Funding Acknowledgements:"),(0,o.kt)("p",null,"Computer Science Department"))}d.isMDXComponent=!0}}]);
Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.