Sciweavers

41 search results - page 2 / 9
» Complexity of unique list colorability
Sort
View
BIOINFORMATICS
2005
134views more  BIOINFORMATICS 2005»
13 years 5 months ago
Outcome signature genes in breast cancer: is there a unique set?
Motivation: direct bearing whose expres Sorlie et al., 2 gene sets is a diseases (Lossos et al., 2004; Miklos and Maleszka, 2004), and the variables that could account questions i...
Liat Ein-Dor, Itai Kela, Gad Getz, David Givol, Ey...
WG
2007
Springer
13 years 11 months ago
The Complexity of Bottleneck Labeled Graph Problems
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
Refael Hassin, Jérôme Monnot, Danny S...
BMCBI
2007
181views more  BMCBI 2007»
13 years 5 months ago
Genes2Networks: connecting lists of gene symbols using mammalian protein interactions databases
Background: In recent years, mammalian protein-protein interaction network databases have been developed. The interactions in these databases are either extracted manually from lo...
Seth I. Berger, Jeremy M. Posner, Avi Ma'ayan
BMCBI
2005
96views more  BMCBI 2005»
13 years 5 months ago
Overview of BioCreAtIvE task 1B: normalized gene lists
Background: Our goal in BioCreAtIve has been to assess the state of the art in text mining, with emphasis on applications that reflect real biological applications, e.g., the cura...
Lynette Hirschman, Marc E. Colosimo, Alexander A. ...
SPAA
2009
ACM
14 years 7 days ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn