Sciweavers

57 search results - page 8 / 12
» Backtracking the rat way
Sort
View
CPM
2005
Springer
109views Combinatorics» more  CPM 2005»
14 years 1 months ago
Using PQ Trees for Comparative Genomics
Permutations on strings representing gene clusters on genomes have been studied earlier in [18, 14, 3, 12, 17] and the idea of a maximal permutation pattern was introduced in [12]....
Gad M. Landau, Laxmi Parida, Oren Weimann
IWINAC
2005
Springer
14 years 1 months ago
Spatial navigation based on novelty mediated autobiographical memory
This paper presents a method for spatial navigation performed mainly on past experiences. The past experiences are remembered in their temporal context, i.e. as episodes of events....
Emilia I. Barakova, Tino Lourens
BMCBI
2006
124views more  BMCBI 2006»
13 years 7 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
ML
2008
ACM
150views Machine Learning» more  ML 2008»
13 years 7 months ago
Learning probabilistic logic models from probabilistic examples
Abstract. We revisit an application developed originally using Inductive Logic Programming (ILP) by replacing the underlying Logic Program (LP) description with Stochastic Logic Pr...
Jianzhong Chen, Stephen Muggleton, José Car...
CP
2003
Springer
14 years 26 days ago
Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
Carlos Eisenberg, Boi Faltings