Minimal Mutation Trees of Sequences
From MaRDI portal
Publication:4074916
DOI10.1137/0128004zbMath0315.05101OpenAlexW2065973977WikidataQ63628671 ScholiaQ63628671MaRDI QIDQ4074916
Publication date: 1975
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0128004
Trees (05C05) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Algorithms in computer science (68W99)
Related Items
Methods for reconstructing the history of tandem repeats and their application to the human genome., Algebraic dynamic programming on trees, Probabilistic models in cluster analysis, Combinatorial algorithms for DNA sequence assembly, Efficient approximation of convex recolorings, On the quirks of maximum parsimony and likelihood on phylogenetic networks, Parametric multiple sequence alignment and phylogeny construction, Approximation algorithms for tree alignment with a given phylogeny, Probability Steiner trees and maximum parsimony in phylogenetic analysis, Multiple sequence comparison -- a peptide matching approach, Approximation algorithms for multiple sequence alignment, Statistical inconsistency of maximum parsimony for \(k\)-tuple-site data, A general framework for enumerating equivalence classes of solutions, Time-dependent-asymmetric-linear-parsimonious ancestral state reconstruction, Matching patterns with variables under edit distance, Topology reconstruction using time series data in telecommunication networks, Minimally colored trees, Parametric maximum parsimonious reconstruction on trees, Minimal Networks: A Review, Maximum likelihood estimation of a migration matrix and effective population sizes in n subpopulations by using a coalescent approach, Improved approximation algorithm for convex recoloring of trees, Locating the vertices of a steiner tree in an arbitrary metric space, Convex recolorings of strings and trees: Definitions, hardness results and algorithms, The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance, A survey of multiple sequence comparison methods, A multiple sequence comparison method, Parametric analysis of alignment and phylogenetic uncertainty, Global alignment of molecular sequences via ancestral state reconstruction, Reconstructing evolution of sequences subject to recombination using parsimony, Quasi-median hulls in Hamming space are Steiner hulls, Unnamed Item, Parsimonious Migration History Problem: Complexity and Algorithms, Comparison of strings belonging to the same family, Approximation algorithms for constrained generalized tree alignment problem, Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree, 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?, Hardness results for the center and median string problems under the weighted and unweighted edit distances, Fixed topology alignment with recombination, General methods of sequence comparison, Line geometries for sequence comparisons, Applying the Thorne-Kishino-Felsenstein model to sequence evolution on a star-shaped tree, Weighted sequence graphs: Boosting iterated dynamic programming using locally suboptimal solutions
