Sciweavers

226 search results - page 11 / 46
» A Practical Algorithm to Find the Best Subsequence Patterns
Sort
View
DLT
2004
13 years 8 months ago
An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars
There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced...
Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
BIRD
2008
Springer
113views Bioinformatics» more  BIRD 2008»
13 years 9 months ago
Matching Spatial Regions with Combinations of Interacting Gene Expression Patterns
The Edinburgh Mouse Atlas aims to capture in-situ gene expression patterns in a common spatial framework. In this study, we construct a grammar to define spatial regions by combina...
Jano I. van Hemert, Richard A. Baldock
SSDBM
2010
IEEE
117views Database» more  SSDBM 2010»
14 years 13 days ago
Finding Top-k Similar Pairs of Objects Annotated with Terms from an Ontology
With the growing focus on semantic searches and interpretations, an increasing number of standardized vocabularies and ontologies are being designed and used to describe data. We ...
Arnab Bhattacharya, Abhishek Bhowmick, Ambuj K. Si...
DSD
2010
IEEE
171views Hardware» more  DSD 2010»
13 years 6 months ago
Test Patterns Compression Technique Based on a Dedicated SAT-Based ATPG
— In this paper we propose a new method of test patterns compression based on a design of a dedicated SAT-based ATPG (Automatic Test Pattern Generator). This compression method i...
Jiri Balcarek, Petr Fiser, Jan Schmidt
EDBT
2002
ACM
129views Database» more  EDBT 2002»
14 years 7 months ago
Schema-Driven Evaluation of Approximate Tree-Pattern Queries
Abstract. We present a simple query language for XML, which supports hierarchical, Boolean-connected query patterns. The interpretation of a query is founded on cost-based query tr...
Torsten Schlieder