𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Note on the Fixed Parameter Tractability of the Gene-Duplication Problem

✍ Scribed by M. S. Bansal; R. Shamir

Book ID
126647209
Publisher
IEEE
Year
2011
Tongue
English
Weight
130 KB
Volume
8
Category
Article
ISSN
1545-5963

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Improving a fixed parameter tractability
Improving a fixed parameter tractability time bound for the shadow problem
✍ Peter Heusch; Stefan Porschen; Ewald Speckenmeyer πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 238 KB

Consider a forest of k trees and n nodes together with a (partial) function s mapping leaves of the trees to non-root nodes of other trees. Define the shadow of a leaf c to be the subtree rooted at sðcÞ: The shadow problem asks whether there is a set S of leaves exactly one from each tree such that

[Lecture Notes in Computer Science] Algo
[Lecture Notes in Computer Science] Algorithms in Bioinformatics Volume 2452 || Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem
✍ GuigΓ³, Roderic; Gusfield, Dan πŸ“‚ Article πŸ“… 2002 πŸ› Springer Berlin Heidelberg 🌐 English βš– 731 KB

We are pleased to present the proceedings of the Second Workshop on Al- rithms in Bioinformatics (WABI 2002), which took place on September 17-21, 2002 in Rome, Italy. The WABI workshop was part of a three-conference me- ing, which, in addition to WABI, included the ESA and APPROX 2002. The three co