29 search results - page 3 / 6 » Sparse RNA Folding: Time and Space Efficient Algorithms |
WABI
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We present three heuristic strategies for folding RNA sequences into secondary structures including kissing hairpin motifs. The new idea is to construct a kissing hairpin...
IWOCA
2010
Springer
13 years 2 months ago
2010
Springer
We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent wi...
ICMLA
2008
13 years 9 months ago
2008
Time-series segmentation in the fully unsupervised scenario in which the number of segment-types is a priori unknown is a fundamental problem in many applications. We propose a Ba...
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
TSP
2008
13 years 7 months ago
2008
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...