• J-MEANS

  • Referenced in 70 articles [sw02649]
  • minimum sum of squares clustering. A new local search heuristic, called J-Means, is proposed ... solving the minimum sum of squares clustering problem. The neighborhood of the current solution ... compared with two other well-known local search heuristics, K- and H-Means as well ... other local search methods, quite substantially when many entities and clusters are considered...
  • MODELLER

  • Referenced in 33 articles [sw27731]
  • alignment of protein sequences and/or structures, clustering, searching of sequence databases, comparison of protein structures...
  • UEGO

  • Referenced in 17 articles [sw02239]
  • UEGO, an abstract clustering technique for multimodal global optimization In this paper, UEGO ... general technique for accelerating and/or parallelizing existing search methods is suggested. The skeleton ... hill climbers work in restricted search regions (or clusters) of the search space. The volume ... clusters decreases as the search proceeds which results in a cooling effect similar to simulated...
  • AutoClass

  • Referenced in 70 articles [sw26092]
  • main difference between clustering and our approach is that we search for the “best...
  • CLOVES

  • Referenced in 12 articles [sw02698]
  • CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery ... propose a multi-phase constructive heuristic that clusters nodes based on proximity, orients them along ... employ genetic algorithm for an intensive final search. Trials on a large number of test...
  • Statistics Toolbox

  • Referenced in 18 articles [sw10157]
  • trees, k-means and hierarchical clustering, k-nearest neighbor search, Gaussian mixtures, and hidden Markov...
  • clustvarsel

  • Referenced in 18 articles [sw07967]
  • implements variable selection methodology for model-based clustering which allows to find the (locally) optimal ... have group/cluster information. A greedy or headlong search can be used, either in a forward ... clustering stage for starting Mclust models. By default the algorithm uses a sequential search...
  • Cd-hit

  • Referenced in 50 articles [sw16887]
  • similar matches between them; cd-hit-est clusters a DNA/RNA sequence database ... popular sequence comparison and database search tools, such as BLAST. Availability:http://cd-hit.org...
  • GGSA

  • Referenced in 5 articles [sw18531]
  • Grouping Gravitational Search Algorithm for data clustering. Gravitational Search Algorithm (GSA) is a stochastic population ... structure of GSA for solving the data clustering problem, the problem of grouping data into...
  • DIRECT

  • Referenced in 65 articles [sw03054]
  • several massively parallel implementations for a global search algorithm DIRECT. Two parallel schemes take different ... load balancing on a 2200 processor cluster...
  • GAPS

  • Referenced in 14 articles [sw02613]
  • convex and non-convex clusters. Kd-tree based nearest neighbor search is used to reduce ... with Point Symmetry (GAPS) distance based clustering algorithm is able to detect any type...
  • piRNABank

  • Referenced in 2 articles [sw23005]
  • Drosophila. It compiles all the possible clusters of piRNAs and also depicts piRNAs along with ... repeats on a genome wide map. Search options have been designed to query and obtain ... following features: Simple search; Search piRNA clusters; Search homologous piRNAs; piRNA visualization...
  • WebACE

  • Referenced in 19 articles [sw24648]
  • process for generating new queries used to search for new related documents and filtering ... traditional clustering algorithms and form the basis for the query generation and search component...
  • P-FCM

  • Referenced in 16 articles [sw02421]
  • proximity-based fuzzy clustering for user-centered web applications. In last years, the Internet ... evolved in an astonishing way. Standard web search services play an important role as useful ... searching metaphors. One of these is the searching of “similar” pages, as offered by Google ... dissimilarity as user’s feedback on the clusters. We present the theoretical framework of this...
  • metapath2vec

  • Referenced in 6 articles [sw37749]
  • tasks, such as node classification, clustering, and similarity search, but also discern the structural...
  • MCQ4Structures

  • Referenced in 4 articles [sw15705]
  • like structure alignment and modelling, motif search or clustering. Thus, there is a constant need...
  • STAR

  • Referenced in 14 articles [sw02515]
  • maximum mappable seed search in uncompressed suffix arrays followed by seed clustering and stitching procedure...
  • Mash

  • Referenced in 3 articles [sw28785]
  • value significance test, enabling the efficient clustering and search of massive sequence collections. Mash reduces ... demonstrate several use cases, including the clustering of all 54,118 NCBI RefSeq genomes ... real-time database search using assembled or unassembled Illumina, Pacific Biosciences, and Oxford Nanopore data ... scalable clustering of hundreds of metagenomic samples by composition. Mash is freely released under...
  • BioPrompt-box

  • Referenced in 3 articles [sw35377]
  • BioPrompt-box: an ontology-based clustering tool for searching in biological databases. Background: High-throughput ... community, where a new generation of Web search engines is being developed, like Vivisimo. These ... which deploys ontology-driven clustering strategies for making the searching process of biologists more efficient...
  • VNDS

  • Referenced in 6 articles [sw07586]
  • networks by variable neighborhood search Finding communities or clusters, in networks, or graphs, has been ... consists in maximizing the sum for all clusters of the number of inner edges minus ... maximize modularity. We apply the variable nighborhood search metaheuristic to that problem. Computational results...