458 search results - page 83 / 92 » Totally magic graphs |
BMCBI
2006
13 years 7 months ago
2006
Background: Gene Ontology (GO) terms are often used to assess the results of microarray experiments. The most common way to do this is to perform Fisher's exact tests to find...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
: This document gives an algebraic and two polygraphic translations of Petri nets, all three providing an easier way to describe reductions and to identify some of them. The first ...
SIAMJO
2002
13 years 7 months ago
2002
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
WINET
2010
13 years 5 months ago
2010
Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is a...
BMCBI
2010
13 years 5 months ago
2010
Background: The Gene Ontology (GO) is a well known controlled vocabulary describing the biological process, molecular function and cellular component aspects of gene annotation. I...