Minimal Mutation Trees of Sequences
From MaRDI portal
Cited in
(45)- Quasi-median hulls in Hamming space are Steiner hulls
- Approximation algorithms for constrained generalized tree alignment problem
- A survey of multiple sequence comparison methods
- A multiple sequence comparison method
- Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree
- Probabilistic models in cluster analysis
- Multiple sequence comparison -- a peptide matching approach
- Approximation algorithms for multiple sequence alignment
- Fixed topology alignment with recombination
- Applying the Thorne-Kishino-Felsenstein model to sequence evolution on a star-shaped tree
- Time-dependent-asymmetric-linear-parsimonious ancestral state reconstruction
- Comparison of strings belonging to the same family
- Weighted sequence graphs: Boosting iterated dynamic programming using locally suboptimal solutions
- Methods for reconstructing the history of tandem repeats and their application to the human genome.
- Combinatorial algorithms for DNA sequence assembly
- Approximation algorithms for tree alignment with a given phylogeny
- On the quirks of maximum parsimony and likelihood on phylogenetic networks
- Statistical inconsistency of maximum parsimony for k-tuple-site data
- Hardness results for the center and median string problems under the weighted and unweighted edit distances
- Algebraic dynamic programming on trees
- Efficient approximation of convex recolorings
- Maximum likelihood estimation of a migration matrix and effective population sizes in n subpopulations by using a coalescent approach
- Minimal networks: a review
- Probability Steiner trees and maximum parsimony in phylogenetic analysis
- Locating the vertices of a steiner tree in an arbitrary metric space
- How to infer ancestral genome features by parsimony: dynamic programming over an evolutionary tree
- Large-Scale Multiple Sequence Alignment and Phylogeny Estimation
- Rearrangements in phylogenetic inference: compare, model, or encode?
- Parsimonious migration history problem: complexity and algorithms
- Outlier detection in BLAST hits
- Parametric analysis of alignment and phylogenetic uncertainty
- Reconstructing evolution of sequences subject to recombination using parsimony
- The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance
- Matching patterns with variables under edit distance
- Topology reconstruction using time series data in telecommunication networks
- Parametric maximum parsimonious reconstruction on trees
- Topology reconstruction in telecommunication networks: embedding operations research within deep learning
- On approximability of Steiner tree in _p-metrics
- Global alignment of molecular sequences via ancestral state reconstruction
- General methods of sequence comparison
- Line geometries for sequence comparisons
- Parametric multiple sequence alignment and phylogeny construction
- Minimally colored trees
- Improved approximation algorithm for convex recoloring of trees
- Convex recolorings of strings and trees: Definitions, hardness results and algorithms
This page was built for publication: Minimal Mutation Trees of Sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4074916)
