Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Pooling designs have been widely used in various aspects of DNA sequencing. In biological applications, the well-studied mathematical problem called "group testing" shifts its focus to nonadaptive algorithms while the focus of traditional group testing is on sequential algorithms. Biological applications also bring forth new models not previously considered, such as the error-tolerant model, the complex model, and the inhibitor model. This book is the first attempt to collect all the significant research on pooling designs in one convenient place. The coverage includes many real biological a

Molecular biology --- Nucleotide sequence --- Combinatorial group theory. --- Combinatorial groups --- Groups, Combinatorial --- Combinatorial analysis --- Group theory --- Analysis, Nucleic acid sequence --- Analysis, Nucleotide sequence --- Base sequence (Nucleic acids) --- DNA sequence --- Nucleic acid sequence analysis --- Nucleotide sequence analysis --- RNA sequence --- Sequence, Nucleotide --- Nucleic acids --- Nucleotides --- Sequence alignment (Bioinformatics) --- Molecular biochemistry --- Molecular biophysics --- Biochemistry --- Biophysics --- Biomolecules --- Systems biology --- Mathematics. --- Analysis

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The need of optimal partition arises from many real-world problems involving the distribution of limited resources to many users. The "clustering" problem, which has recently received a lot of attention, is a special case of optimal partitioning. This book is the first attempt to collect all theoretical developments of optimal partitions, many of them derived by the authors, in an accessible place for easy reference. Much more than simply collecting the results, the book provides a general framework to unify these results and present them in an organized fashion. Many well-known practical prob

Partitions (Mathematics) --- Number theory --- Operational research. Game theory

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The Steiner problem asks for a shortest network which spans a given set of points. Minimum spanning networks have been well-studied when all connections are required to be between the given points. The novelty of the Steiner tree problem is that new auxiliary points can be introduced between the original points so that a spanning network of all the points will be shorter than otherwise possible. These new points are called Steiner points - locating them has proved problematic and research has diverged along many different avenues.This volume is devoted to the assimilation of the rich field of intriguing analyses and the consolidation of the fragments. A section has been given to each of the three major areas of interest which have emerged. The first concerns the Euclidean Steiner Problem, historically the original Steiner tree problem proposed by Jarní k and Kö ssler in 1934. The second deals with the Steiner Problem in Networks, which was propounded independently by Hakimi and Levin and has enjoyed the most prolific research amongst the three areas. The Rectilinear Steiner Problem, introduced by Hanan in 1965, is discussed in the third part. Additionally, a forth section has been included, with chapters discussing areas where the body of results is still emerging.The collaboration of three authors with different styles and outlooks affords individual insights within a cohesive whole.

Steiner, systèmes de. --- Handelsreizigersprobleem. --- Netwerkanalyse. --- Steiner systems. --- Steiner, Systèmes de --- Steiner systems --- 519.87 --- Networks, Steiner --- Steiner networks --- Steiner triple systems --- Systems, Steiner --- Triple systems, Steiner --- Block designs --- Mathematical models for operational research --- 519.87 Mathematical models for operational research

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The Steiner problem asks for a shortest network which spans a given set of points. Minimum spanning networks have been well-studied when all connections are required to be between the given points. The novelty of the Steiner tree problem is that new auxiliary points can be introduced between the original points so that a spanning network of all the points will be shorter than otherwise possible. These new points are called Steiner points - locating them has proved problematic and research has diverged along many different avenues. This volume is devoted to the assimilation of the rich field of intriguing analyses and the consolidation of the fragments. A section has been given to each of the three major areas of interest which have emerged. The first concerns the Euclidean Steiner Problem, historically the original Steiner tree problem proposed by Jarník and Kössler in 1934. The second deals with the Steiner Problem in Networks, which was propounded independently by Hakimi and Levin and has enjoyed the most prolific research amongst the three areas. The Rectilinear Steiner Problem, introduced by Hanan in 1965, is discussed in the third part. Additionally, a forth section has been included, with chapters discussing areas where the body of results is still emerging. The collaboration of three authors with different styles and outlooks affords individual insights within a cohesive whole.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The need for optimal partition arises from many real-world problems involving the distribution of limited resources to many users. The ""clustering"" problem, which has recently received a lot of attention, is a special case of optimal partitioning. This book is the first attempt to collect all theoretical developments of optimal partitions, many of them derived by the authors, in an accessible place for easy reference. Much more than simply collecting the results, the book provides a general framework to unify these results and present them in an organized fashion. Many well-known practical p

Mathematics --- Physical Sciences & Mathematics --- Algebra --- Partitions (Mathematics) --- Number theory