Sciweavers

255 search results - page 14 / 51
» Approximate matching of secondary structures
Sort
View
TSP
2008
115views more  TSP 2008»
13 years 9 months ago
A Bayesian Approach to Adaptive Detection in Nonhomogeneous Environments
Abstract--We consider the adaptive detection of a signal of interest embedded in colored noise, when the environment is nonhomogeneous, i.e., when the training samples used for ada...
Stéphanie Bidon, Olivier Besson, Jean-Yves ...
WABI
2001
Springer
142views Bioinformatics» more  WABI 2001»
14 years 1 months ago
Pattern Matching and Pattern Discovery Algorithms for Protein Topologies
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...
Juris Viksna, David Gilbert
MICS
2010
137views more  MICS 2010»
13 years 7 months ago
Finding Range Minima in the Middle: Approximations and Applications
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...
Johannes Fischer, Volker Heun
CORR
2012
Springer
222views Education» more  CORR 2012»
12 years 4 months ago
A limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
SOFSEM
2010
Springer
14 years 6 months ago
Fast Arc-Annotated Subsequence Matching in Linear Space
An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings P and Q the arc-...
Philip Bille, Inge Li Gørtz