A Polynomial-Time Algorithm For the Perfect Phylogeny Problem When the Number of Character States is Fixed
type: Item
instance of: scholarly article
title: A Polynomial-Time Algorithm For the Perfect Phylogeny Problem When the Number of Character States is Fixed
zbMATH Open document ID: 0835.68052
DOI: 10.1137/S0097539793244587
author: Richa Agarwala
author: David Fernández-Baca
published in: SIAM Journal on Computing
publication date: 1995-04-06T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 92-08
zbMATH DE Number: 741072
zbMATH Keywords: character compatibility
zbMATH Keywords: perfect phylogeny
zbMATH Keywords: polynomial-time algorithm
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 741072