Pages that link to "Item:Q4074916"
From MaRDI portal
The following pages link to Minimal Mutation Trees of Sequences (Q4074916):
Displaying 44 items.
- Probability Steiner trees and maximum parsimony in phylogenetic analysis (Q393567) (← links)
- Parametric analysis of alignment and phylogenetic uncertainty (Q542021) (← links)
- Reconstructing evolution of sequences subject to recombination using parsimony (Q584109) (← links)
- Parametric maximum parsimonious reconstruction on trees (Q644569) (← links)
- Global alignment of molecular sequences via ancestral state reconstruction (Q713206) (← links)
- General methods of sequence comparison (Q799527) (← links)
- Line geometries for sequence comparisons (Q800250) (← links)
- Parametric multiple sequence alignment and phylogeny construction (Q876718) (← links)
- Minimally colored trees (Q908876) (← links)
- Improved approximation algorithm for convex recoloring of trees (Q927405) (← links)
- Convex recolorings of strings and trees: Definitions, hardness results and algorithms (Q931727) (← links)
- Quasi-median hulls in Hamming space are Steiner hulls (Q1003664) (← links)
- Approximation algorithms for constrained generalized tree alignment problem (Q1028112) (← links)
- A survey of multiple sequence comparison methods (Q1191624) (← links)
- A multiple sequence comparison method (Q1203745) (← links)
- Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree (Q1281780) (← links)
- Probabilistic models in cluster analysis (Q1350792) (← links)
- Multiple sequence comparison -- a peptide matching approach (Q1390863) (← links)
- Approximation algorithms for multiple sequence alignment (Q1391132) (← links)
- Fixed topology alignment with recombination (Q1585336) (← links)
- Applying the Thorne-Kishino-Felsenstein model to sequence evolution on a star-shaped tree (Q1600350) (← links)
- Time-dependent-asymmetric-linear-parsimonious ancestral state reconstruction (Q1687036) (← links)
- Comparison of strings belonging to the same family (Q1818790) (← links)
- Weighted sequence graphs: Boosting iterated dynamic programming using locally suboptimal solutions (Q1868715) (← links)
- Methods for reconstructing the history of tandem repeats and their application to the human genome. (Q1872719) (← links)
- Combinatorial algorithms for DNA sequence assembly (Q1902464) (← links)
- Approximation algorithms for tree alignment with a given phylogeny (Q1924406) (← links)
- On the quirks of maximum parsimony and likelihood on phylogenetic networks (Q2399624) (← links)
- Statistical inconsistency of maximum parsimony for \(k\)-tuple-site data (Q2417506) (← links)
- Hardness results for the center and median string problems under the weighted and unweighted edit distances (Q2569417) (← links)
- Algebraic dynamic programming on trees (Q2633220) (← links)
- Efficient approximation of convex recolorings (Q2643731) (← links)
- Maximum likelihood estimation of a migration matrix and effective population sizes in \(n\) subpopulations by using a coalescent approach (Q2710165) (← links)
- Minimal Networks: A Review (Q2977710) (← links)
- Locating the vertices of a steiner tree in an arbitrary metric space (Q4077102) (← links)
- How to Infer Ancestral Genome Features by Parsimony: Dynamic Programming over an Evolutionary Tree (Q4992754) (← links)
- Large-Scale Multiple Sequence Alignment and Phylogeny Estimation (Q4992756) (← links)
- Rearrangements in Phylogenetic Inference: Compare, Model, or Encode? (Q4992757) (← links)
- Parsimonious Migration History Problem: Complexity and Algorithms (Q5090365) (← links)
- (Q5111831) (← links)
- The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance (Q5874533) (← links)
- A general framework for enumerating equivalence classes of solutions (Q6046942) (← links)
- Matching patterns with variables under edit distance (Q6111591) (← links)
- Topology reconstruction using time series data in telecommunication networks (Q6196883) (← links)
