Results 111 to 120 of about 325,256 (164)
Target-similarity search using Plasmodium falciparum proteome identifies approved drugs with anti-malarial activity and their possible targets. [PDF]
PLoS One, 2017 Mogire RM +8 more
europepmc +1 more source
PSimScan: algorithm and utility for fast protein similarity search. [PDF]
PLoS One, 2013 Kaznadzey A +3 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Current Protocols in Protein Science, 2018
AbstractSequence similarity searching has become an important part of the daily routine of molecular biologists, bioinformaticians and biophysicists. With the rapidly growing sequence databanks, this computational approach is commonly applied to determine functions and structures of unannotated sequences, to investigate relationships between sequences,
Gang, Hu, Lukasz, Kurgan
openaire +2 more sources
AbstractSequence similarity searching has become an important part of the daily routine of molecular biologists, bioinformaticians and biophysicists. With the rapidly growing sequence databanks, this computational approach is commonly applied to determine functions and structures of unannotated sequences, to investigate relationships between sequences,
Gang, Hu, Lukasz, Kurgan
openaire +2 more sources
On Asymmetric Similarity Search
2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA), 2015Similarity, and the strongly related inverse concept of distance, plays an important role in many data mining techniques. Typically, the definitions of similarity/distance measures are restricted to being symmetric. In this paper, however, we consider asymmetric measures and show that there are justifiable reasons in many domains for preferring ...
Ankita Garg +2 more
openaire +1 more source
Efficient Algorithms for Similarity Search
Journal of Combinatorial Optimization, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sanguthevar Rajasekaran +6 more
openaire +1 more source
Computation of Similarity—Similarity Search as Computation
2011We present a number of applications in Natural Language Processing where the main computation consists of a similarity search for an input pattern in a large database. Afterwards we describe some efficient methods and algorithms for solving this computational challenge.
Stoyan Mihov, Klaus U. Schulz
openaire +1 more source
Journal of Popular Music Studies, 2022
Throughout the twentieth and twenty-first centuries regulations on expert testimony have sought to minimize the impact of disagreeing experts. Yet, disagreements between forensic musicologists still play a large role in contemporary music copyright decisions.
openaire +1 more source
Throughout the twentieth and twenty-first centuries regulations on expert testimony have sought to minimize the impact of disagreeing experts. Yet, disagreements between forensic musicologists still play a large role in contemporary music copyright decisions.
openaire +1 more source
WIREs Computational Molecular Science, 2011
AbstractSimilarity searching is one of the traditional and most widely applied approaches in chemical and pharmaceutical research to select compounds with desired properties from databases. The computational efficiency of many (but not all) similarity search techniques has further increased their popularity as compound databases began to rapidly grow ...
Dagmar Stumpfe, Jürgen Bajorath
openaire +1 more source
AbstractSimilarity searching is one of the traditional and most widely applied approaches in chemical and pharmaceutical research to select compounds with desired properties from databases. The computational efficiency of many (but not all) similarity search techniques has further increased their popularity as compound databases began to rapidly grow ...
Dagmar Stumpfe, Jürgen Bajorath
openaire +1 more source
On the complexity of reverse similarity search
2008 IEEE 24th International Conference on Data Engineering Workshop, 2008Two decision problems are presented that arise from reversing the operation of a distance-based indexing tree. Whereas similarity search finds points in the tree given a query point, reverse similarity search begins with a set of constraints like those defining a leaf and generates a point meeting the constraints.
openaire +1 more source
Similarity Pruning in PrOM Search
2006In this paper we introduce a new pruning mechanism, called Similarity Pruning for Probabilistic Opponent-Model (PrOM) Search. It is based on imposing a bound on the differences between two or more evaluation functions. Assuming such a bound exists, we are able to prove two theoretical properties, viz., the bound-conservation property and the bounded ...
H. H. L. M. Donkers +2 more
openaire +1 more source