2013
DOI: 10.1186/1471-2105-14-251
|View full text |Cite
|
Sign up to set email alerts
|

GRank: a middleware search engine for ranking genes by relevance to given genes

Abstract: BackgroundBiologists may need to know the set of genes that are semantically related to a given set of genes. For instance, a biologist may need to know the set of genes related to another set of genes known to be involved in a specific disease. Some works use the concept of gene clustering in order to identify semantically related genes. Others propose tools that return the set of genes that are semantically related to a given set of genes. Most of these gene similarity measures determine the semantic similar… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
6
2

Relationship

4
4

Authors

Journals

citations
Cited by 12 publications
(15 citation statements)
references
References 14 publications
0
6
0
Order By: Relevance
“…In addition to the above mentioned domains and by considering system services and operations, there are some other special-purpose applications which need various features of middleware domains to perform their task properly. For example WebCrawler [25] and GRank [26] are two search engines middleware that uses a combination of aforementioned domains capabilities.…”
Section: Communicationmentioning
confidence: 99%
“…In addition to the above mentioned domains and by considering system services and operations, there are some other special-purpose applications which need various features of middleware domains to perform their task properly. For example WebCrawler [25] and GRank [26] are two search engines middleware that uses a combination of aforementioned domains capabilities.…”
Section: Communicationmentioning
confidence: 99%
“…We observe that a vertex v is important to a set S of vertices in a network, if S is existence dependent on v through the paths of the MST that connect v and S. That is, v is important to S, if the existence of S in the network is dependent on the existence of v. An existence dependency relation will be added between vertices u and v if, wherever v exists, it is as part of u; the presence of v implies the presence of u [20,23,24]. Thus, if the relationship between u and v represents existence-dependency, u and v are closely related.…”
Section: Identifying the Influential Members Of A Criminal Organizationmentioning
confidence: 99%
“…In network partitioning, a network is divided into positions based on the structural similarities among the vertices of the network [28]. Similar techniques have also been used in the area of bioinformatics [40,42].…”
Section: Ieee Transactions On Information Forensics and Securitymentioning
confidence: 99%