Sentence examples for maximal pairing problem from inspiring English sources

In this contribution, we introduced a polynomial algorithm for the Maximal Pairing Problem (MPP) as well as some variants.

The Maximal Pairing Problem (MPP) is the prototype of a class of combinatorial optimization problems that are of considerable interest in bioinformatics: Given an arbitrary phylogenetic tree T and weights ω xy for the paths between any two pairs of leaves (x, y), what is the collection of edge-disjoint paths between pairs of leaves that maximizes the total weight?

It conceptually corresponds to Maddison's "maximal pairing" [ 2], although we describe here a more general problem (see Background and Variants).

The all-pairs maximal overlap problem can be optimally solved in O(N+ k) time using a generalized suffix tree where N=∑ i =1|ℛ||ℛ i | and k=|ℛ| (Gusfield, 1997).

The Hadamard maximal determinant problem asks for the largest n×n determinant with entries ±1.

Hub covering problems, as location-allocation problems, consist of two sub problems namely hub set covering problem (HSCP) and hub maximal covering problem (HMCP).

This paper presents a fuzzy maximal covering location problem (FMCLP) in which travel time between any pair of nodes is considered to be a fuzzy variable.

The authors call it the cooperative gradual maximal covering location problem (CGMCLP).

In particular, we analyze the Maximal Covering Location Problem (MCLP) and the Basic p-Median Model.

These working set pairs are referred as maximal violating pair where violation is subject to KKT conditions [1].

Moreover we introduce different types of minimal superstring and maximal substring problems.