Clustering in trees: Optimizing cluster sizes and number of subtrees.

Hambrusch, Susanne E.; Liu, Chuan-Ming; Lim, Hyeong-Seok

Displaying similar documents to “Clustering in trees: Optimizing cluster sizes and number of subtrees.”

Codings and operators in two genetic algorithms for the leaf-constrained minimum spanning tree problem

Bryant Julstrom (2004)

International Journal of Applied Mathematics and Computer Science

Similarity:

The features of an evolutionary algorithm that most determine its performance are the coding by which its chromosomes represent candidate solutions to its target problem and the operators that act on that coding. Also, when a problem involves constraints, a coding that represents only valid solutions and operators that preserve that validity represent a smaller search space and result in a more effective search. Two genetic algorithms for the leaf-constrained minimum spanning tree problem...

Three new heuristics for the Steiner problem in graphs.

Diané, M., Plesník, Ján (1991)

Acta Mathematica Universitatis Comenianae. New Series

Similarity:

The triangles method to build $X$ -trees from incomplete distance matrices

Alain Guénoche, Bruno Leclerc (2001)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

A method to infer $X$ -trees (valued trees having $X$ as set of leaves) from incomplete distance arrays (where some entries are uncertain or unknown) is described. It allows us to build an unrooted tree using only 2 $n$ -3 distance values between the $n$ elements of $X$ , if they fulfill some explicit conditions. This construction is based on the mapping between $X$ -tree and a weighted generalized 2-tree spanning $X$ .

Distances between rooted trees

Bohdan Zelinka (1991)

Mathematica Bohemica

Similarity:

Two types of a distance between isomorphism classes of graphs are adapted for rooted trees.

Worst-case relative performances of heuristics for the Steiner problem in graphs.

Plesník, Ján (1991)

Acta Mathematica Universitatis Comenianae. New Series

Similarity:

Combinatorial interpretation of generalized Stirling numbers.

Lang, Wolfdieter (2009)

Journal of Integer Sequences [electronic only]

Similarity:

On the rules for the elimination of the non-canonical Morgan trees

Damir Vukičević (2009)

Kragujevac Journal of Mathematics

Similarity:

A Bicriterion Steiner Tree Problem on Graph

Mirko Vujošević, Milan Stanojević (2003)

The Yugoslav Journal of Operations Research

Similarity:

Bijective counting of tree-rooted maps and shuffles of parenthesis systems.

Bernardi, Olivier (2007)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Programming and Testing a Two-Tree Algorithm

Vassilev, Tzvetalin, Ammerlaan, Joanna (2013)

Serdica Journal of Computing

Similarity:

ACM Computing Classification System (1998): G.2.2, F.2.2. Recently, Markov, Vassilev and Manev [2] proposed an algorithm for finding the longest path in 2-trees. In this paper, we describe an implementation of the algorithm. We briefly discuss the algorithm and present example that helps the reader grasp the main algorithmic ideas. Further, we discuss the important stages in the implementation of the algorithm and justify the decisions taken. Then, we present experimental...

On a matching distance between rooted phylogenetic trees

Damian Bogdanowicz, Krzysztof Giaro (2013)

International Journal of Applied Mathematics and Computer Science

Similarity:

The Robinson-Foulds (RF) distance is the most popular method of evaluating the dissimilarity between phylogenetic trees. In this paper, we define and explore in detail properties of the Matching Cluster (MC) distance, which can be regarded as a refinement of the RF metric for rooted trees. Similarly to RF, MC operates on clusters of compared trees, but the distance evaluation is more complex. Using the graph theoretic approach based on a minimum-weight perfect matching in bipartite graphs,...