On the parameterized complexity of the multi-MCT and multi-MCST problems
From MaRDI portal
Publication:630185
DOI10.1007/s10878-009-9220-2zbMath1213.90209OpenAlexW1995757231WikidataQ57436912 ScholiaQ57436912MaRDI QIDQ630185
Nagiza F. Samatova, Wenbin Chen, Matthew C. Schmidt
Publication date: 17 March 2011
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-009-9220-2
Cites Work
- Unnamed Item
- The parameterized complexity of sequence alignment and consensus
- Finding largest subtrees and smallest supertrees
- On the approximation of largest common subtrees and largest common point sets
- An algebraic view of the relation between largest common subtrees and smallest common supertrees
- Analogs & duals of the MAST problem for sequences & trees
This page was built for publication: On the parameterized complexity of the multi-MCT and multi-MCST problems