Reconstructing Unrooted Phylogenetic Trees from Symbolic Ternary Metrics-Reference-Cited by-同舟云学术

Reconstructing Unrooted Phylogenetic Trees from Symbolic Ternary Metrics

Published:2018-03-09 Issue:6 Volume:80 Page:1563-1577
ISSN:0092-8240
Container-title:Bulletin of Mathematical Biology
language:en
Short-container-title:Bull Math Biol

Author:

Grünewald Stefan,Long Yangjing,Wu Yaokun

Funder

National Natural Science Foundation of China

Postdoctoral Science Foundation of China

STCSM

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,General Agricultural and Biological Sciences,Pharmacology,General Environmental Science,General Biochemistry, Genetics and Molecular Biology,General Mathematics,Immunology,General Neuroscience

Link

http://link.springer.com/article/10.1007/s11538-018-0413-7/fulltext.html

Reference13 articles.

1. Bandelt H-J, Steel MA (1995) Symmetric matrices representable by weighted trees over a cancellative abelian monoid. SIAM J Discret Math 8(4):517–525

2. Böcker S, Dress AWM (1998) Recovering symbolically dated, rooted trees from symbolic ultrametrics. Adv Math 138(1):105–125

3. Colonius H, Schulze HH (1981) Tree structures for proximity data. Br J Math Stat Psychol 34(2):167–180

4. Dress A, Huber TK (2012) Basic phylogenetic combinatorics. Cambridge University Press, Cambridge

5. Gurvich V (1984) Decomposing complete edge-chromatic graphs and hypergraphs. Doklady Akad. Nauk SSSR 279(6):1306–1310 (in Russian)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. From modular decomposition trees to level-1 networks: Pseudo-cographs, polar-cats and prime polar-cats;Discrete Applied Mathematics;2022-11

2. Generalized Fitch graphs II: Sets of binary relations that are explained by edge-labeled trees;Discrete Applied Mathematics;2020-09

3. Generalized Fitch graphs: Edge-labeled graphs that are explained by edge-labeled trees;Discrete Applied Mathematics;2019-08