Analogs & duals of the MAST problem for sequences & trees-Reference-Cited by-同舟云学术

Analogs & duals of the MAST problem for sequences & trees

Published:2003-10 Issue:1 Volume:49 Page:192-216
ISSN:0196-6774
Container-title:Journal of Algorithms
language:en
Short-container-title:Journal of Algorithms

Author:

Fellows Michael,Hallett Michael,Stege Ulrike

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computational Mathematics,Control and Optimization

Reference26 articles.

1. Foundations of Computer Science;Aho,1992

2. Parameterized complexity analysis in computational biology;Bodlaender;Comput. Appl. Biosci.,1995

3. The parameterized complexity of the longest common subsequence problem;Bodlaender;Theoret. Comput. Sci. A,1995

4. D. Bryant, Building trees, hunting for trees, and comparing trees—theory and methods in phylogenetic analysis, PhD thesis, Department of Mathematics, University of Canterbury, 1997

5. The recovery of trees from measures of dissimilarity;Buneman,1971

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

1. New Alternatives to Optimize Policy Classifiers;IEEE/ACM Transactions on Networking;2020-06

2. Algorithms, kernels and lower bounds for the Flood-It game parameterized by the vertex cover number;Discrete Applied Mathematics;2018-08

3. A Survey on the Complexity of Flood-Filling Games;Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications;2018

4. Tractability and hardness of flood-filling games on trees;Theoretical Computer Science;2015-04

5. On the Space and Circuit Complexity of Parameterized Problems: Classes and Completeness;Algorithmica;2014-10-16