Sciweavers

255 search results - page 9 / 51
» Approximate matching of secondary structures
Sort
View
ESA
2005
Springer
136views Algorithms» more  ESA 2005»
14 years 2 months ago
Approximating the 2-Interval Pattern Problem
We address the problem of approximating the 2-Interval Pattern problem over its various models and restrictions. This problem, which is motivated by RNA secondary structure predict...
Maxime Crochemore, Danny Hermelin, Gad M. Landau, ...
CPM
2004
Springer
156views Combinatorics» more  CPM 2004»
14 years 2 months ago
A Computational Model for RNA Multiple Structural Alignment.
Abstract. This paper addresses the problem of aligning multiple sequences of non-coding RNA genes. We approach this problem with the biologically motivated paradigm that scoring of...
Eugene Davydov, Serafim Batzoglou
JCB
2007
136views more  JCB 2007»
13 years 9 months ago
A Structure-Based Flexible Search Method for Motifs in RNA
The discovery of non-coding RNA (ncRNA) motifs and their role in regulating gene expression has recently attracted considerable attention. The goal is to discover these motifs in ...
Isana Veksler-Lublinsky, Michal Ziv-Ukelson, Danny...
VLDB
2005
ACM
104views Database» more  VLDB 2005»
14 years 2 months ago
Approximate Matching of Hierarchical Data Using pq-Grams
When integrating data from autonomous sources, exact matches of data items that represent the same real world object often fail due to a lack of common keys. Yet in many cases str...
Nikolaus Augsten, Michael H. Böhlen, Johann G...
SPIRE
2007
Springer
14 years 3 months ago
Approximate String Matching with Lempel-Ziv Compressed Indexes
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
Luís M. S. Russo, Gonzalo Navarro, Arlindo ...