scientific article; zbMATH DE number 1303034
From MaRDI portal
Publication:4249534
zbMATH Open0924.92016MaRDI QIDQ4249534FDOQ4249534
Authors: Michael R. Fellows, Michael T. Hallett, Ulrike Stege
Publication date: 10 November 1999
Title of this publication is not available (Why is that?)
Recommendations
Cited In (16)
- Complexity insights of the minimum duplication problem
- Mathematical properties of the gene duplication cost
- The Impact of Parameterized Complexity to Interdisciplinary Problem Solving
- Complexity insights of the minimum duplication problem
- Building species trees from larger parts of phylogenomic databases
- Genomes Containing Duplicates Are Hard to Compare
- Computing the tandem duplication distance is NP-hard
- Reconciling a gene tree to a species tree under the duplication cost model
- Reconciling multiple genes trees via segmental duplications and losses
- From Gene Trees to Species Trees
- Solving the gene duplication feasibility problem in linear time
- Title not available (Why is that?)
- From Gene Trees to Species Trees through a Supertree Approach
- An approximation algorithm for computing a parsimonious first speciation in the gene duplication model
- An algorithmic view on multi-related-segments: a unifying model for approximate common interval
- A scalable parallelization of the gene duplication problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249534)