"A Fast Algorithm for the Computation and Enumeration of Perfect ..."

Sampath Kannan, Tandy J. Warnow (1995)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2016-03-14

- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/soda/KannanW95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/KannanW95
Sampath Kannan, Tandy J. Warnow:
A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies when the Number of Character States is Fixed. SODA 1995: 595-603

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.