3894 search results - page 563 / 779 » Approximation Algorithms for Biclustering Problems |
153
click to vote
TCBB
2011
14 years 10 months ago
2011
—We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The computational problem is to build a consensus map, which...
123
click to vote
ICIP
2005
IEEE
16 years 5 months ago
2005
IEEE
Appropriate rate control plays a very important role in encoding motion pictures under the constant bit-rate. One of the requirements for rate control is minimizing temporal fluct...
133
click to vote
RECOMB
2008
Springer
16 years 4 months ago
2008
Springer
Whole genome comparison based on gene order has become a popular approach in comparative genomics. An important task in this field is the detection of gene clusters, i.e. sets of g...
124
click to vote
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
105
click to vote
COCOON
2007
Springer
15 years 10 months ago
2007
Springer
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...