2877 search results - page 400 / 576 » Biological Computing |
164
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: Identifying functional elements, such as transcriptional factor binding sites, is a fundamental step in reconstructing gene regulatory networks and remains a challengi...
170
click to vote
FOCS
2005
IEEE
16 years 2 days ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
190
click to vote
PAKDD
2004
ACM
15 years 11 months ago
2004
ACM
Inductive queries are queries to an inductive database that generate a set of patterns in a data mining context. Inductive querying poses new challenges to database and data mining...
172
click to vote
JMLR
2006
15 years 6 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
163
click to vote
IADIS
2008
15 years 8 months ago
2008
One approach to reduce the complexity of the task in the analysis of large scale genome-wide expression is to group the genes showing similar expression patterns into what are cal...