Deciding whether two n-point sets A,B ∈ R are congruent is a fundamental problem in geometric pattern matching. When the dimension d is unbounded, the problem is equivalent to graph isomorphism and is conjectured to be in FPT. When |A| = m < |B| = n, the problem becomes that of deciding whether A is congruent to a subset of B and is known to be NP-complete. We show that point subset congruence,...

Given a digraph D, the Minimum Leaf Out-Branching problem (MinLOB) is the problem of finding in D an out-branching with the minimum possible number of leaves, i.e., vertices of out-degree 0. We describe three parameterizations of MinLOB and prove that two of them are NP-complete for every value of the parameter, but the third one is fixed-parameter tractable (FPT). The FPT parametrization is as...

UNLABELLED Processing acoustic clues from the sounds of speech depends on the proper perception of the frequency and duration of stimuli as a sequence of events. AIM To assess the capacity for temporal organization in users of multichannel CI. METHOD 14 normal hearing individuals formed the control group, matching in age and gender other 14 users of multichannel CI, who made up the study gr...

Backdoors measure the distance to tractable fragments and have become an important tool to find fixed-parameter tractable (fpt) algorithms. Despite their success, backdoors have not been used for planning, a central problem in AI that has a high computational complexity. In this work, we introduce two notions of backdoors building upon the causal graph. We analyze the complexity of finding a sm...

Minimum Common String Partition (MCSP) has drawn much attention due to its application in genome rearrangement. In this paper, we investigate three variants of MCSP: MCSP , which requires that there are at most c elements in the alphabet; d-MCSP, which requires the occurrence of each element to be bounded by d; and x-balanced MCSP, which requires the length of blocks being in range (n/k − x, n/...

We study the parameterized complexity of three NP hard graph completion problems The MINIMUM FILL IN problem is to decide if a graph can be triangulated by adding at most k edges We develop an O k mn f k algorithm for this problem on a graph with n vertices and m edges In particular this implies that the problem is xed parameter tractable FPT The PROPER INTERVAL GRAPH COMPLETION problem motivat...

This paper introduces a novel molecular description--topological (2D) fuzzy pharmacophore triplets, 2D-FPT--using the number of interposed bonds as the measure of separation between the atoms representing pharmacophore types (hydrophobic, aromatic, hydrogen-bond donor and acceptor, cation, and anion). 2D-FPT features three key improvements with respect to the state-of-the-art pharmacophore fing...

Pedotransfer Functions (FPT) are mathematical models that estimate difficult-to-measure soil properties through more accessible variables, generating optimization of time and financial resources. In this study, six Functions, based on the equation Van Genuchten, analyzed for prediction volumetric moisture Brazilian soils, with data from global database Soil Data Task. Applied pressures 0, 0.01,...

The Traditional Chinese Medicine herbs Pollen Typhae and Pollen Typhae Carbonisatus have been used as a hemostatic medicine promoting blood clotting for thousands of years. In this study, a reliable, highly sensitive method based on LC-MS/MS has been developed for differentiation of the heating products of total flavonoids in Pollen Typhae (FPT-N). Twenty three peaks were detected and 18 peaks ...