Convex recolorings of strings and trees: Definitions, hardness results and algorithms
type: Item
instance of: scholarly article
title: Convex recolorings of strings and trees: Definitions, hardness results and algorithms
zbMATH Open document ID: 1160.68025
author: Shlomo Moran
author: Sagi Snir
published in: Journal of Computer and System Sciences
publication date: 2008-06-26T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 92D15
zbMATH DE Number: 5293394
zbMATH Keywords: algorithms
zbMATH Keywords: complexity
zbMATH Keywords: phylogenetics
zbMATH Keywords: dynamic programming
zbMATH Keywords: fixed parameter tractability
MaRDI profile type: Publication
full work available at URL: j.jcss.2007.10.003
OpenAlex ID: W2029029999
cites work: SIMPLE ALGORITHMS FOR PERFECT PHYLOGENY AND TRIANGULATING COLORED GRAPHS
cites work: Selecting the branches for an evolutionary tree.
cites work: Two strikes against perfect phylogeny
cites work: Q4393480
cites work: Convex tree realizations of partitions
cites work: A Polynomial-Time Algorithm for Near-Perfect Phylogeny
cites work: Minimizing phylogenetic number to find good evolutionary trees
cites work: Efficient algorithms for inferring evolutionary trees
cites work: Inferring Evolutionary History From DNA Sequences
cites work: A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies
cites work: Q5519710
cites work: Minimal Mutation Trees of Sequences
cites work: Q4792088
cites work: The complexity of reconstructing trees from qualitative characters and subtrees
DOI: 10.1016/J.JCSS.2007.10.003
description: scientific article; zbMATH DE number 5293394