Sciweavers

1142 search results - page 78 / 229
» Set Variables and Local Search
Sort
View
CONIELECOMP
2005
IEEE
14 years 3 months ago
Approximate Searching on Compressed Text
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
Carlos Avendaño Pérez, Claudia Fereg...
TMC
2008
125views more  TMC 2008»
13 years 10 months ago
Distributed Algorithm for Efficient Construction and Maintenance of Connected k-Hop Dominating Sets in Mobile Ad Hoc Networks
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
Hong-Yen Yang, Chia-Hung Lin, Ming-Jer Tsai
BMCBI
2006
124views more  BMCBI 2006»
13 years 10 months ago
Predicting transcription factor binding sites using local over-representation and comparative genomics
Background: Identifying cis-regulatory elements is crucial to understanding gene expression, which highlights the importance of the computational detection of overrepresented tran...
Matthieu Defrance, Hélène Touzet
CEC
2007
IEEE
14 years 4 months ago
Incrementally maximising hypervolume for selection in multi-objective evolutionary algorithms
— Several multi-objective evolutionary algorithms compare the hypervolumes of different sets of points during their operation, usually for selection or archiving purposes. The ba...
Lucas Bradstreet, R. Lyndon While, Luigi Barone
NAR
2011
188views Computer Vision» more  NAR 2011»
13 years 29 days ago
NCBI Epigenomics: a new public resource for exploring epigenomic data sets
The Epigenomics database at the National Center for Biotechnology Information (NCBI) is a new resource that has been created to serve as a comprehensive public resource for whole-...
Ian M. Fingerman, Lee McDaniel, Xuan Zhang, Walter...