58 search results - page 5 / 12 » The pauseless GC algorithm |
GC
2007
Springer
13 years 7 months ago
2007
Springer
The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of co...
ISNN
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. This paper studies the extension of the Generalization Complexity (GC) measure to real valued input problems. The GC measure, defined in Boolean space, was proposed as a...
BMCBI
2010
13 years 7 months ago
2010
Background: The quality of automated gene prediction in microbial organisms has improved steadily over the past decade, but there is still room for improvement. Increasing the num...
TSMC
2008
13 years 7 months ago
2008
Given a genome, i.e., a long string over a fixed finite alphabet, the problem is to find short (dis)similar substrings. This computationally intensive task has many biological appl...
BMCBI
2006
13 years 7 months ago
2006
Background: Although it is not difficult for state-of-the-art gene finders to identify coding regions in prokaryotic genomes, exact prediction of the corresponding translation ini...