Results 241 to 250 of about 358,315 (287)
Exploring the protein universe with distant similarity detection methods. [PDF]
Sahakyan H +3 more
europepmc +1 more source
Is the reverse vaccinology idea becoming exhausted? [PDF]
Zumárraga J +4 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Similarity Searching Using Reduced Graphs.
ChemInform, 2003Reduced graphs provide summary representations of chemical structures. In this work, the effectiveness of reduced graphs for similarity searching is investigated. Different types of reduced graphs are introduced that aim to summarize features of structures that have the potential to form interactions with receptors while retaining the topology between ...
Valerie J, Gillet +2 more
openaire +2 more sources
Multihierarchical graph search
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2002The use of hierarchical graph searching for finding paths in graphs is well known in the literature, providing better results than plain graph searching, with respect to computational costs, in many cases. This paper offers a step forward by including multiple hierarchies in a graph-based model.
J.-A. Fernandez-Madrigal, J. Gonzalez
openaire +1 more source
Proceedings of the 2019 International Conference on Management of Data, 2019
We study \em interactive graph search (IGS), with the conceptual objective of departing from the conventional "top-down" strategy in searching a poly-hierarchy, a.k.a.\ a decision graph. In IGS, a machine assists a human in looking for a target node z in an acyclic directed graph G, by repetitively asking questions.
Yufei Tao, Yuanbing Li, Guoliang Li
openaire +1 more source
We study \em interactive graph search (IGS), with the conceptual objective of departing from the conventional "top-down" strategy in searching a poly-hierarchy, a.k.a.\ a decision graph. In IGS, a machine assists a human in looking for a target node z in an acyclic directed graph G, by repetitively asking questions.
Yufei Tao, Yuanbing Li, Guoliang Li
openaire +1 more source
Efficient Budgeted Graph Search
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022Iterative Budgeted Exponential Search (IBEX) is a general search algorithm that can limit the number of re-expansions performed in common problems like iterative-deepening tree search and search with inconsistent heuristics. IBEX has been adapted into a specific tree algorithm, Budgeted Tree Search (BTS), which behaves like IDA* when the problem ...
Jasmeet Kaur, Nathan R. Sturtevant
openaire +1 more source
Graph searching on chordal graphs
1996Two variations of the graph searching problem, edge searching and node searching, are studied on several classes of chordal graphs, which include split graphs, interval graphs and k-starlike graphs.
Sheng-Lung Peng +4 more
openaire +1 more source
Graph Searching and Search Time
2006Graph searching is the game of capturing a fugitive by a team of searchers in a network. There are equivalent characterizations in terms of path-width, interval thickness, and vertex separation. So far the interest has mainly focused on the search number of a graph, which is the minimal the number of searchers to win the game, and accordingly on the ...
Franz J. Brandenburg, Stephanie Herrmann
openaire +1 more source
Blocking for external graph searching
Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '93, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nodine, M. H. +2 more
openaire +2 more sources

