On the number of binary characters needed to recover a phylogeny using maximum parsimony
type: Item
instance of: scholarly article
title: On the number of binary characters needed to recover a phylogeny using maximum parsimony
zbMATH Open document ID: 1215.92045
author: Juanjuan Chai
author: Elizabeth Ann Housworth
published in: Bulletin of Mathematical Biology
publication date: 2011-06-22T00:00:00Z
Mathematics Subject Classification ID: 92D15
Mathematics Subject Classification ID: 65Y20
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 65Y99
Mathematics Subject Classification ID: 05C90
zbMATH DE Number: 5911540
zbMATH Keywords: homoplasy
zbMATH Keywords: one-clustering
MaRDI profile type: Publication
full work available at URL: s11538-010-9579-3
OpenAlex ID: W2088272905
cites work: Q4448740
cites work: Proving phylogenetic trees minimal with l-clustering and set partitioning
cites work: Four Characters Suffice to Convexly Define a Phylogenetic Tree
cites work: A Separator Theorem for Planar Graphs
Wikidata QID: Q44359297
DOI: 10.1007/S11538-010-9579-3
description: scientific article; zbMATH DE number 5911540