Sciweavers

29 search results - page 4 / 6
» Sparse RNA Folding: Time and Space Efficient Algorithms
Sort
View
JCB
2007
108views more  JCB 2007»
13 years 9 months ago
A Dynamic Programming Approach for Finding Common Patterns in RNAs
We developed a dynamic programming approach of computing common sequence structure patterns among two RNAs given their primary sequences and their secondary structures. Common pat...
Sven Siebert, Rolf Backofen
CCCG
2010
13 years 11 months ago
Towards a dynamic data structure for efficient bounded line range search
We present a data structure for efficient axis-aligned orthogonal range search on a set of n lines in a bounded plane. The algorithm requires O(log n + k) time in the worst case t...
Thuy Le, Bradford G. Nickerson
PAMI
2007
138views more  PAMI 2007»
13 years 9 months ago
A Fast Biologically Inspired Algorithm for Recurrent Motion Estimation
—We have previously developed a neurodynamical model of motion segregation in cortical visual area V1 and MT of the dorsal stream. The model explains how motion ambiguities cause...
Pierre Bayerl, Heiko Neumann
ICDE
2006
IEEE
232views Database» more  ICDE 2006»
14 years 11 months ago
Dual Labeling: Answering Graph Reachability Queries in Constant Time
Graph reachability is fundamental to a wide range of applications, including XML indexing, geographic navigation, Internet routing, ontology queries based on RDF/OWL, etc. Many ap...
Haixun Wang, Hao He, Jeffrey Xu Yu, Jun Yang 0001,...
CADE
2006
Springer
14 years 10 months ago
Solving Sparse Linear Constraints
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
Shuvendu K. Lahiri, Madanlal Musuvathi