Sciweavers

123 search results - page 21 / 25
» Algorithms for computing variants of the longest common subs...
Sort
View
CPM
2006
Springer
182views Combinatorics» more  CPM 2006»
13 years 11 months ago
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
Johannes Fischer, Volker Heun
MP
2006
87views more  MP 2006»
13 years 7 months ago
Convexity and decomposition of mean-risk stochastic programs
Abstract. Traditional stochastic programming is risk neutral in the sense that it is concerned with the optimization of an expectation criterion. A common approach to addressing ri...
Shabbir Ahmed
RECOMB
2009
Springer
14 years 8 months ago
New Perspectives on Gene Family Evolution: Losses in Reconciliation and a Link with Supertrees
Reconciliation between a set of gene trees and a species tree is the most commonly used approach to infer the duplication and loss events in the evolution of gene families, given a...
Cedric Chauve, Nadia El-Mabrouk
BMCBI
2006
137views more  BMCBI 2006»
13 years 7 months ago
A classification-based framework for predicting and analyzing gene regulatory response
Background: We have recently introduced a predictive framework for studying gene transcriptional regulation in simpler organisms using a novel supervised learning algorithm called...
Anshul Kundaje, Manuel Middendorf, Mihir Shah, Chr...
BMCBI
2006
112views more  BMCBI 2006»
13 years 7 months ago
A correlated motif approach for finding short linear motifs from protein interaction networks
Background: An important class of interaction switches for biological circuits and disease pathways are short binding motifs. However, the biological experiments to find these bin...
Soon-Heng Tan, Hugo Willy, Wing-Kin Sung, See-Kion...