15485 search results - page 35 / 3097 » Computing Optimal Subsets |
RECOMB
2009
Springer
14 years 2 months ago
2009
Springer
In genome rearrangements, the double cut and join (DCJ) operation, introduced by Yancopoulos et al., allows to represent most rearrangement events that could happen in multichromos...
BMCBI
2007
13 years 7 months ago
2007
Background: An important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods h...
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
Given a set of patterns and a similarity measure between them, we will present an optimization framework to approximate a small subset, known as a canonical set, whose members clo...
HEURISTICS
2002
13 years 7 months ago
2002
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...
JMLR
2010
13 years 2 months ago
2010
Identifying a subset of features that preserves classification accuracy is a problem of growing importance, because of the increasing size and dimensionality of real-world data se...