Shortest Connectivity: An Introduction with Applications in Phylogeny de Dietmar Cieslik

Shortest Connectivity: An Introduction with Applications in Phylogeny: Combinatorial Optimization, cartea 17

en Limba Engleză Hardback – 19 noi 2004

The aim in this graduate level text is to outline the key mathematical concepts that underpin these important questions in applied mathematics. These concepts involve discrete mathematics (particularly graph theory), optimization, computer science, and several ideas in biology.

Citește tot Restrânge

Toate formatele și edițiile

	Preț	Express
Paperback (1)	624^.44 lei 39-44 zile
Springer Us – 21 noi 2014	624^.44 lei 39-44 zile
Hardback (1)	611^.72 lei 6-8 săpt.
Springer Us – 19 noi 2004	611^.72 lei 6-8 săpt.

Din seria Combinatorial Optimization

18%

Preț: 900^.22 lei
20%

Preț: 615^.63 lei
20%

Preț: 1222^.07 lei
20%

Preț: 1823^.39 lei
15%

Preț: 642^.24 lei
18%

Preț: 903^.68 lei
Preț: 372^.52 lei
15%

Preț: 611^.72 lei
20%

Preț: 958^.67 lei
18%

Preț: 904^.87 lei
15%

Preț: 660^.99 lei
18%

Preț: 1577^.29 lei
20%

Preț: 935^.09 lei
15%

Preț: 608^.04 lei
20%

Preț: 936^.19 lei
15%

Preț: 603^.53 lei
Preț: 386^.48 lei

Preț: 611^.72 lei

Preț vechi: 719^.67 lei
-15% Nou

Puncte Express: 918

:
117^.09€ • 125^.90$ • 97^.61£

Carte tipărită la comandă

Livrare economică 19 decembrie 24 - 02 ianuarie 25

Adaugă în coș

Wish list
Gift list
Am citit!

Adaugă în listă

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780387235387
ISBN-10: 0387235388
Pagini: 268
Ilustrații: IX, 268 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.57 kg
Ediția:2005
Editura: Springer Us
Colecția Springer
Seria Combinatorial Optimization

Locul publicării:New York, NY, United States

Public țintă

Research

Cuprins

Two Classical Optimization Problems.- Gauss’ Question.- What Does Solution Mean?.- Network Design Problems.- A New Challenge: The Phylogeny.- An Analysis of Steiner’s Problem in Phylogenetic Spaces.- Tree Building Algorithms.

Recenzii

From the reviews of the first edition:
"The aim of this graduate-level text is to summarize mathematical concepts concerned with problems of shortest connectivity, and to demonstrate important applications of the theory, in particular in biology. … The book contains extensive references and gives rise to many problems for further research. … Examples are discussed in the history of evolution, taxonomy, historical linguistics and others." (Günther Karigl, Zentralblatt MATH, Vol. 1086, 2006)

Textul de pe ultima copertă

The problem of "Shortest Connectivity" has a long and convoluted history: given a finite set of points in a metric space, search for a network that connects these points with the shortest possible length. This shortest network must be a tree and may contain vertices different from the points which are to be connected. Over the years more and more real-life problems are given, which use this problem or one of its relatives as an application, as a subproblem or a model.
This volume is an introduction to the theory of "Shortest Connectivity", as the core of the so-called "Geometric Network Design Problems", where the general problem can be stated as follows: given a configuration of vertices and/or edges, find a network which contains these objects, satisfies some predetermined requirements, and which minimizes a given objective function that depends on several distance measures. A new application of shortest connectivity is also discussed, namely to create trees which reflect the evolutionary history of "living entities".
The aim in this graduate level text is to outline the key mathematical concepts that underpin these important questions in applied mathematics. These concepts involve discrete mathematics (particularly graph theory), optimization, computer science, and several ideas in biology.

Caracteristici

No other graduate level textbooks for network design and phylogenetic reconstructing Includes supplementary material: sn.pub/extras

Papetărie, jocuri, reviste