Sciweavers

32 search results - page 7 / 7
» Branch and Recharge: Exact Algorithms for Generalized Domina...
Sort
View
IWPEC
2010
Springer
14 years 9 months ago
On the Kernelization Complexity of Colorful Motifs
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Ch...
119
Voted
TCBB
2008
117views more  TCBB 2008»
14 years 11 months ago
Consensus Genetic Maps as Median Orders from Inconsistent Sources
A genetic map is an ordering of genetic markers calculated from a population of known lineage. Although, traditionally, a map has been generated from a single population for each s...
Benjamin G. Jackson, Patrick S. Schnable, Srinivas...