Results 41 to 50 of about 325,256 (164)
Optimal neighborhood indexing for protein similarity search
BMC Bioinformatics, 2008 Background Similarity inference, one of the main bioinformatics tasks, has to face an exponential growth of the biological data. A classical approach used to cope with this data flow involves heuristics with large seed indexes.
Nguyen Van +5 more
doaj +1 more source
Frontiers in PharmacologyIntroductionLeishmaniasis remains a major neglected tropical disease, and new therapeutic strategies are urgently needed. This study aimed to identify the molecular target of 2-aryl-quinoline-4-carboxylic acid derivatives and assess their pharmacokinetic
Marília Cecília da Silva +8 more
doaj +1 more source
Hard problems in similarity searching
Discrete Applied Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Moan, Christophe, Rusu, Irena
openaire +4 more sources
Hashing for Similarity Search: A Survey
CoRR, 2014 Similarity search (nearest neighbor search) is a problem of pursuing the data items whose distances to a query item are the smallest from a large database. Various methods have been developed to address this problem, and recently a lot of efforts have been devoted to approximate search.
Jingdong Wang 0001 +3 more
openaire +2 more sources
A Network View on the Big Exchange Project: Integrating and Analysing Heterogeneous Datasets
Journal of Computer Applications in ArchaeologyThis study presents a proof-of-concept for integrating 14 datasets on 11 archaeologically relevant raw materials from the Big Exchange project into a heterogeneous information network (HIN), an informational structure explicitly modelling multiple object
Mattis thor Straten +5 more
doaj +1 more source
Spreading vectors for similarity search
, 2018 Discretizing multi-dimensional data distributions is a fundamental step of modern indexing methods. State-of-the-art techniques learn parameters of quantizers on training data for optimal performance, thus adapting quantizers to the data. In this work, we propose to reverse this paradigm and adapt the data to the quantizer: we train a neural net which ...
Sablayrolles, Alexandre +3 more
openaire +4 more sources
Center selection techniques for metric indexes
Journal of Computer Science and Technology, 2007 The metric spaces model formalizes the similarity search concept in nontraditional databases. The goal is to build an index designed to save distance computations when answering similarity queries later. A large class of algorithms to build the index are
Cristian Mendoza Alric +1 more
doaj
Molecules, 2014 We describe a ligand-based approach towards compounds with more specific targeting for Burkitt’s lymphoma. Using three-dimensional ligand-based similarity searches and a previously described hit compound, we have identified six compounds that are ...
Martina Gobec +5 more
doaj +1 more source
Combinatorial Framework for Similarity Search [PDF]
2009 Second International Workshop on Similarity Search and Applications, 2009 We present an overview of combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are allowed. Namely, the input dataset is represented by a comparison oracle that given any three points X,Y,Z answers whether Y or Z is closer to X. We assume that the similarity order
openaire +1 more source
Spatial selection of sparse pivots for similarity search in metric spaces
Journal of Computer Science and Technology, 2007 Similarity search is a fundamental operation for applications that deal with unstructured data sources. In this paper we propose a new pivot-based method for similarity search, called Sparse Spatial Selection (SSS). The main characteristic of this method
Nieves Rodríguez Brisaboa +3 more
doaj