𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A hybrid clustering and graph based algorithm for tagSNP selection

✍ Scribed by Mao-Zu Guo; Jun Wang; Chun-yu Wang; Yang Liu

Publisher
Springer
Year
2009
Tongue
English
Weight
557 KB
Volume
13
Category
Article
ISSN
1432-7643

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Parallelism, Preprocessing, and Reachabi
Parallelism, Preprocessing, and Reachability: A Hybrid Algorithm for Directed Graphs
✍ P.N. Klein πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 602 KB

The problem of reachability in a directed graph has resisted attempts at efficient parallelization. Only for fairly dense graphs can we efficiently achieve significant parallel speedups, using known methods. We describe a technique allowing significant parallel speedup even for moderately sparse gra

A new efficient algorithm based on DC pr
A new efficient algorithm based on DC programming and DCA for clustering
✍ Le Thi Hoai An; M. Tayeb Belghiti; Pham Dinh Tao πŸ“‚ Article πŸ“… 2006 πŸ› Springer US 🌐 English βš– 221 KB

In this paper, a version of K-median problem, one of the most popular and best studied clustering measures, is discussed. The model using squared Euclidean distances terms to which the K-means algorithm has been successfully applied is considered. A fast and robust algorithm based on DC (Difference

A hybrid hint-based and graph-based fram
A hybrid hint-based and graph-based framework for recognition of interacting milling features
✍ K. Rahmani; B. Arezoo πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 629 KB

Among the existing feature recognition approaches, graph-based and hint-based approaches are more popular. While graph-based algorithms are quite successful in recognizing isolated features, hint based approaches intrinsically show better performance in handling interacting features. In this paper,