A Clique-Based Method for Improving Motif Scanning Accuracy
We present a new approach for improving motif scanning accuracy, based on analysis of in-between similarity. Given a set of motifs obtained from a scanning process, we construct an associated weighted graph. We also compute the expected weight of an edge in such a graph. It turns out that restricting results to the maximal clique in the graph, computed with respect to the expected weight, greatly increases precision, hence improves accuracy of the scan. We tested the method on an ungapped motif-characterized protein family from five plant proteomes. The method was applied to three iterative motif scanners - PSI-BLAST, JackHMMer and IGLOSS - with very good results
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Motif Prediction with Graph Neural Networks
Link prediction is one of the central problems in graph mining. However, recent studies highlight the importance of higher-order network analysis, where complex structures called motifs are the first-class citizens. We f…
Graph MiningGraph Neural NetworkLink PredictionPredictionClassification of Temporal Graphs using Persistent Homology
Temporal graphs effectively model dynamic systems by representing interactions as timestamped edges. However, analytical tools for temporal graphs are limited compared to static graphs. We propose a novel method for anal…
ClassificationGraph ClassificationDictionary Learning in Fourier Transform Scanning Tunneling Spectroscopy
Modern high-resolution microscopes, such as the scanning tunneling microscope, are commonly used to study specimens that have dense and aperiodic spatial structure. Extracting meaningful information from images obtained …
Dictionary LearningNode Classification via Simplicial Interaction with Augmented Maximal Clique Selection
Considering higher-order interactions allows for a more comprehensive understanding of network structures beyond simple pairwise connections. While leveraging all cliques in a network to handle higher-order interactions …
Node ClassificationCLIPPER+: A Fast Maximal Clique Algorithm for Robust Global Registration
We present CLIPPER+, an algorithm for finding maximal cliques in unweighted graphs for outlier-robust global registration. The registration problem can be formulated as a graph and solved by finding its maximum clique. T…
Point Cloud Registration