Minimizing phylogenetic number to find good evolutionary trees

Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Elizabeth Sweedyk, Tandy Warnow

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Inferring phylogenetic trees is a fundamental problem in computational-biology. We present a new objective criterion, the phylogenetic number, for evaluating evolutionary trees for species defined by biomolecular sequences or other qualitative characters. The phylogenetic number of a tree T is the maximum number of times that any given character state arises in T. By contrast, the classical parsimonycriterion measures the total number of times that different character states arise in T. We consider the following related problems: finding the tree with minimum phylogenetic number, and computing the phylogenetic number of a given topology in which only the leaves are labeled by species. When the number of states is bounded (as is the case for biomolecular sequence characters), we can solve the second problem in polynomial time. We can also compute a fixed-topology 2-phylogeny (when one exists) for an arbitrary number of states. This algorithm can be used to further distinguish trees that are equal under parsimony. We also consider a number of other related problems.

Original languageEnglish (US)
Title of host publicationCombinatorial Pattern Matching - 6th Annual Symposium, CPM 1995, Proceedings
EditorsZvi Galil, Esko Ukkonen
PublisherSpringer-Verlag Berlin Heidelberg
Pages102-127
Number of pages26
ISBN (Print)3540600442, 9783540600442
DOIs
StatePublished - Jan 1 1995
Externally publishedYes
Event6th Annual Symposium on Combinatorial Pattern Matching, CPM 1995 - Espoo, Finland
Duration: Jul 5 1995Jul 7 1995

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume937
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other6th Annual Symposium on Combinatorial Pattern Matching, CPM 1995
CountryFinland
CityEspoo
Period7/5/957/7/95

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Minimizing phylogenetic number to find good evolutionary trees'. Together they form a unique fingerprint.

Cite this