A classification of the six-point prime metrics
European Journal of Combinatorics
NeighborNet: An Agglomerative Method for the Construction of Planar Phylogenetic Networks
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
Phylogenetic Networks: Modeling, Reconstructibility, and Accuracy
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
The Fine Structure of Galls in Phylogenetic Networks
INFORMS Journal on Computing
Beyond galled trees: decomposition and computation of galled networks
RECOMB'07 Proceedings of the 11th annual international conference on Research in computational molecular biology
Counting Faces in Split Networks
ISBRA '09 Proceedings of the 5th International Symposium on Bioinformatics Research and Applications
A Fast Quartet tree heuristic for hierarchical clustering
Pattern Recognition
Optimizing Phylogenetic Networks for Circular Split Systems
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
| Hi-index | 0.00 |
We address the problem of constructing phylogenetic networks using two criteria: the number of cycles and the fit value of the network. Traditionally the fit value is the main objective for evaluating phylogenetic networks. However, a small number of cycles in a network is desired and pointed out in several publications.We propose a new phylogenetic network called CS-networkand a method for constructing it. The method is based on the well-known splitstree method. A CS-network contains a face which is k-cycle, k驴 3 (not as splitstree). We discuss difficulties of using non-parallelogram faces in splitstree networks. Our method involves clustering and optimization of weights of the network edges.The algorithm for constructing the underlying graph (except the optimization step) has a polynomial time. Experimental results show a good performance of our algorithm.