The farthest string problem (FARTHEST STRING) is one of the core problems in the field of consensus word analysis and several biological problems such as discovering potential drugs, universal primers, or unbiased consensus sequences. Given k strings of the same length L and a nonnegative integer d, FARTHEST STRING is to find a string s such that none of the given strings has a Hamming distance...

We present an indexing scheme that is capable of answering a broad range of complex top-k queries that contain a scalar product between two vectors when one of the vectors is present in the database, while the other one arrives at query time. Specifically we provide indexing facilities for the top-k closest points below (above) a hyperplane and the top-k farthest points below (above) a hyperpla...

Let P be a set of n points in the plane. The k-nearest neighbor (k-NN) query problem is to preprocess P into a data structure that quickly reports k closest points in P for a query point q. This paper addresses a generalization of the k-NN query problem to a query set Q of points, namely, the group nearest neighbor problem, in the L1 plane. More precisely, a query is assigned with a set Q of at...

The irregular domain and lack of ordering make it challenging to design deep neural networks for point cloud processing. This paper presents a novel framework named Point Cloud Transformer(PCT) learning. PCT is based on Transformer, which achieves huge success in natural language processing displays great potential image It inherently permutation invariant sequence points, making well-suited To...

Membranes with immobilized GM3-type oligosaccharide were prepared and influenza virus adsorption was evaluated. GM3-type oligosaccharide which has azido group in the aglycon was synthesized by saccharide primer method. The azido group was used for combination by click chemistry with alkyne which is introduced to membranes. The position of the azido group in the aglycon of GM3-type oligosacchari...

Given a set of sites in a simple polygon, a geodesic Voronoi diagram partitions the polygon into regions based on distances to sites under the geodesic metric. We present algorithms for computing the geodesic nearest-point, higher-order and farthest-point Voronoi diagrams of m point sites in a simple n-gon, which improve the best known ones form ≤ n/polylogn. Moreover, the algorithms for the ne...