BIONJ

swMATH8301MaRDI QIDQ20311FDOQ20311

Author name not available (Why is that?)

Cited In (30)

• Analysis of Phylogenetics and Evolution with R
• Title not available (Why is that?)
• Minimum tree cost quartet puzzling
• An algorithm for the fitting of a tree metric according to a weighted least-squares criterion
• A variance-components model for distance-matrix phylogenetic reconstruction
• Large-Scale Multiple Sequence Alignment and Phylogeny Estimation
• A `stochastic safety radius' for distance-based tree reconstruction
• Reconstruction of large phylogenetic trees: a parallel approach
• The neighbor-net algorithm
• Using the tangle: A consistent construction of phylogenetic distance matrices for quartets
• Determining phylogenetic networks from inter-taxa distances
• An algebraic hypothesis about the primeval genetic code architecture
• Title not available (Why is that?)
• An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances
• Modeling the distribution of distance data in Euclidean space
• Why neighbor-joining works
• Comparing evolutionary distances via adaptive distance functions
• A fast quartet tree heuristic for hierarchical clustering
• The minimum evolution problem: Overview and classification
• Bioinformatics and phylogenetics. Seminal contributions of Bernard Moret
• PathOGiST: A Novel Method for Clustering Pathogen Isolates by Combining Multiple Genotyping Signals
• Geometric combinatorics and computational molecular biology: Branching polytopes for RNA sequences
• Consistency of the QNet algorithm for generating planar split networks from weighted quartets
• Phylogenetic trees and Euclidean embeddings
• Bioinformatics. Volume I. Data, sequence analysis, and evolution
• Choosing the tree which actually best explains the data: another look at the bootstrap in phylogenetic reconstruction.
• Progressive clustering based method for protein function prediction
• The triangles method to build \(X\)-trees from incomplete distance matrices
• Two local dissimilarity measures for weighted graphs with application to protein interaction networks
• A novel approach to phylogenetic trees: d‐Dimensional geometric Steiner trees

This page was built for software: BIONJ