Parallel Minimum Spanning Tree Based by Elsayad Dina (8 results)

Condition: New. 112 pp., paperback, new. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.

Condition: New. pp. 112.

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book is dedicated to interested people in Bioinformatics, High performance computing, Microarrays data clustering, Gene expression analysis. The DNA Microarrays technology is a high-throughput experimental technique that can measure expression levels of hundreds of thousands of genes simultaneously. The DNA microarrays data clustering aims to organize genes that those with similar expression patterns are grouped together to identifying biologically relevant groups of genes. This book proposed three minimum spanning tree -based clustering algorithms for gene expression analysis. The performance of the proposed algorithms (iCLUMP, iCLUMP-2 and hiCLUMP) was tested on a 45 processing nodes cluster using various cancer microarrays data sets. The results showed that the order of the proposed algorithms in terms of minimum runtime and maximum speedup/efficiency is iCLUMP-2 , iCLUMP and hiCLUMP. Furthermore the quality of the cluster produced by the iCLUMP-2 algorithm is much better than those produced by the other algorithms. 112 pp. Englisch.

Condition: New. Print on Demand pp. 112 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam.

Condition: New. PRINT ON DEMAND pp. 112.

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Elsayad DinaDina Elsayad Egyptian researcher graduated from Faculty of Computer & Information Sciences, Ain Shams University 2007, Cairo - Egypt.Has obtained her master degree in Bioinformatics and High Performance Computing in 201.

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This book is dedicated to interested people in Bioinformatics, High performance computing, Microarrays data clustering, Gene expression analysis. The DNA Microarrays technology is a high-throughput experimental technique that can measure expression levels of hundreds of thousands of genes simultaneously. The DNA microarrays data clustering aims to organize genes that those with similar expression patterns are grouped together to identifying biologically relevant groups of genes. This book proposed three minimum spanning tree -based clustering algorithms for gene expression analysis. The performance of the proposed algorithms (iCLUMP, iCLUMP-2 and hiCLUMP) was tested on a 45 processing nodes cluster using various cancer microarrays data sets. The results showed that the order of the proposed algorithms in terms of minimum runtime and maximum speedup/efficiency is iCLUMP-2 , iCLUMP and hiCLUMP. Furthermore the quality of the cluster produced by the iCLUMP-2 algorithm is much better than those produced by the other algorithms.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 112 pp. Englisch.

Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This book is dedicated to interested people in Bioinformatics, High performance computing, Microarrays data clustering, Gene expression analysis. The DNA Microarrays technology is a high-throughput experimental technique that can measure expression levels of hundreds of thousands of genes simultaneously. The DNA microarrays data clustering aims to organize genes that those with similar expression patterns are grouped together to identifying biologically relevant groups of genes. This book proposed three minimum spanning tree -based clustering algorithms for gene expression analysis. The performance of the proposed algorithms (iCLUMP, iCLUMP-2 and hiCLUMP) was tested on a 45 processing nodes cluster using various cancer microarrays data sets. The results showed that the order of the proposed algorithms in terms of minimum runtime and maximum speedup/efficiency is iCLUMP-2 , iCLUMP and hiCLUMP. Furthermore the quality of the cluster produced by the iCLUMP-2 algorithm is much better than those produced by the other algorithms.