scientific article; zbMATH DE number 1303534
From MaRDI portal
Publication:4250156
Recommendations
Cited in
(34)- Testing the theory of evolution: A novel application of combinatorial optimization
- Approximation algorithms for the fixed-topology phylogenetic number problem
- Algorithms for phylogeny reconstruction in a new mathematical model
- On the complexity of constructing evolutionary trees
- On characteristics of ancestral character-state reconstructions under the accelerated transformation optimization
- Phylogenetic flexibility via Hall-type inequalities and submodularity
- Inferring phylogenetic trees from the knowledge of rare evolutionary events
- Heuristics for the phylogeny problem
- A few logs suffice to build (almost) all trees. II
- Character-based phylogeny construction and its application to tumor evolution
- Optimizing phylogenetic diversity under constraints
- Maximum likelihood estimates of pairwise rearrangement distances
- Is the protein model assignment problem under linked branch lengths NP-hard?
- Inferring phylogenetic trees using pseudo-Boolean optimization
- Combinatorial optimization solutions for the maximum quartet consistency problem
- Characterizing local optima for maximum parsimony
- scientific article; zbMATH DE number 5713387 (Why is no real title available?)
- Probability Steiner trees and maximum parsimony in phylogenetic analysis
- scientific article; zbMATH DE number 637307 (Why is no real title available?)
- scientific article; zbMATH DE number 1088267 (Why is no real title available?)
- Constructing Computer Virus Phylogenies
- scientific article; zbMATH DE number 1956215 (Why is no real title available?)
- scientific article; zbMATH DE number 2040759 (Why is no real title available?)
- Comparing different operators and models to improve a multiobjective artificial bee colony algorithm for inferring phylogenies
- Parsimonious migration history problem: complexity and algorithms
- Facility location in the phylogenetic tree space
- Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion
- Adaptive memory programming: local search parallel algorithms for phylogenetic tree construc\-tion
- Towards the development of computational tools for evaluating phylogenetic network reconstruction methods
- A memetic algorithm to schedule planned maintenance for the national grid
- On contract-and-refine transformations between phylogenetic trees
- Minimizing phylogenetic number to find good evolutionary trees
- Learning latent tree models with small query complexity
- A tabu search algorithm for maximum parsimony phylogeny inference
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250156)