Hunting for Trees in Binary Character Sets: Efficient Algorithms for Extraction, Enumeration, and Optimization-Reference-Cited by-同舟云学术

Hunting for Trees in Binary Character Sets: Efficient Algorithms for Extraction, Enumeration, and Optimization

Published:1996-01 Issue:2 Volume:3 Page:275-288
ISSN:1066-5277
Container-title:Journal of Computational Biology
language:en
Short-container-title:Journal of Computational Biology

Author:

BRYANT DAVID

Publisher

Mary Ann Liebert Inc

Subject

Computational Theory and Mathematics,Computational Mathematics,Genetics,Molecular Biology,Modeling and Simulation

Link

http://www.liebertpub.com/doi/pdf/10.1089/cmb.1996.3.275

Reference13 articles.

1. The median procedure for n-trees

2. Computational Complexity of Inferring Phylogenies by Compatibility

3. Efficient algorithms for inferring evolutionary trees

4. Human Origins and Analysis of Mitochondrial DNA Sequences

5. Inferring Evolutionary History From DNA Sequences

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

1. Forcing external constraints on tree inference using ASTRAL;BMC Genomics;2020-04

2. Efficient Local Search for Euclidean Path-Difference Median Trees;IEEE/ACM Transactions on Computational Biology and Bioinformatics;2019-07-01

3. Computing Manhattan Path-Difference Median Trees: A Practical Local Search Approach;IEEE/ACM Transactions on Computational Biology and Bioinformatics;2019-07-01

4. Transcript Abundance Estimation and the Laminar Packing Problem;Algorithms for Computational Biology;2019

5. Manhattan Path-Difference Median Trees;Proceedings of the 7th ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics;2016-10-02