Pages that link to "Item:Q1603544"

The following pages link to Partition-distance: A problem and class of perfect graphs arising in clustering (Q1603544):

Displayed 14 items.

• Bayesian pedigree inference with small numbers of single nucleotide polymorphisms via a factor-graph representation (Q304447) ‎ (← links)
• Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions (Q500971) ‎ (← links)
• An efficient algorithm for computing the distance between close partitions (Q617900) ‎ (← links)
• A simulated annealing algorithm for maximum likelihood pedigree reconstruction (Q849461) ‎ (← links)
• Ensemble clustering by means of clustering embedding in vector spaces (Q898340) ‎ (← links)
• An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring (Q976050) ‎ (← links)
• A search space ``cartography'' for guiding graph coloring heuristics (Q1040976) ‎ (← links)
• Consensus of partitions: a constructive approach (Q1761306) ‎ (← links)
• Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction (Q1762010) ‎ (← links)
• Suppression distance computation for hierarchical clusterings (Q2346561) ‎ (← links)
• On constructing an optimal consensus clustering from multiple clusterings (Q2380012) ‎ (← links)
• A commentary on some recent methods in sibling group reconstruction based on set coverings (Q3096891) ‎ (← links)
• On Application of the Partition Distance Concept to a Comparative Analysis of Psychological or Sociological Tests (Q3375540) ‎ (← links)
• Set covering approach for reconstruction of sibling relationships (Q5758164) ‎ (← links)