Results 161 to 170 of about 916,150 (184)

Natural language processing of gene descriptions for overrepresentation analysis with GeneTEA. [PDF]

open access: yesGenome Biol
Boyle IA   +6 more
europepmc   +1 more source
Some of the next articles are maybe not open access.

Related searches:

An Algorithm for the Bisection Problem on Trivially Perfect Graphs

AIP Conference Proceedings, 2009
A graph G is trivially perfect if for each induced subgraph H of G, the number of maximal cliques of H is equal to the maximum size of an independent set of H. In this paper we give an algorithm that solves the bisection problem in trivially perfect graphs and present some applications of this result in location problems.
Elena Nechita   +2 more
exaly   +2 more sources

A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements

Information Processing Letters, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly   +3 more sources

Home - About - Disclaimer - Privacy