Tools
Tools
Huber, Katharina T., Moulton, Vincent 
ORCID: https://orcid.org/0000-0001-9371-6435 and Steel, Mike
(2003)
Four characters suffice.
In: Formal Power Series and Algebraic Combinatorics, 2003-06-23 - 2003-06-27, Linköping University.
Abstract
It was recently shown that just five characters (functions on a finite set X) suffice to convexly define a trivalent tree with leaf set X. Here we show that four characters suffice which, since three characters are not general enough, is the best possible.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Faculty \ School: | Faculty of Science > School of Computing Sciences |
| UEA Research Groups: | Faculty of Science > Research Groups > Computational Biology Faculty of Science > Research Groups > Computational Biology > Phylogenetics (former - to 2018) Faculty of Science > Research Groups > Norwich Epidemiology Centre Faculty of Medicine and Health Sciences > Research Groups > Norwich Epidemiology Centre Faculty of Science > Research Groups > Computational Biology > Computational biology of RNA (former - to 2018) |
| Related URLs: | |
| Depositing User: | Vishal Gautam |
| Date Deposited: | 23 Jul 2011 15:40 |
| Last Modified: | 20 Jun 2023 14:34 |
| URI: | https://ueaeprints.uea.ac.uk/id/eprint/23803 |
| DOI: |
Actions (login required)
 |
View Item |