53 search results - page 11 / 11 » Regularity Lemmas and Combinatorial Algorithms |
BMCBI
2002
13 years 5 months ago
2002
Background: Pattern matching is the core of bioinformatics; it is used in database searching, restriction enzyme mapping, and finding open reading frames. It is done repeatedly ov...
ESA
2004
Springer
13 years 11 months ago
2004
Springer
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
SIAMJO
2002
13 years 5 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 ...