Results 1 - 10 of 1,404

Linear pattern matching algorithms

by Peter Weiner - IN PROCEEDINGS OF THE 14TH ANNUAL IEEE SYMPOSIUM ON SWITCHING AND AUTOMATA THEORY. IEEE , 1972
"... In 1970, Knuth, Pratt, and Morris [1] showed how to do basic pattern matching in linear time. Related problems, such as those discussed in [4], have previously been solved by efficient but sub-optimal algorithms. In this paper, we introduce an interesting data structure called a bi-tree. A linear ti ..."
Abstract - Cited by 546 (0 self) - Add to MetaCart
time algorithm for obtaining a compacted version of a bi-tree associated with a given string is presented. With this construction as the basic tool, we indicate how to solve several pattern matching problems, including some from [4], in linear time.

Fast subsequence matching in time-series databases

by Christos Faloutsos, M. Ranganathan, Yannis Manolopoulos - PROCEEDINGS OF THE 1994 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA , 1994
"... We present an efficient indexing method to locate 1-dimensional subsequences within a collection of sequences, such that the subsequences match a given (query) pattern within a specified tolerance. The idea is to map each data sequence into a small set of multidimensional rectangles in feature space ..."
Abstract - Cited by 533 (24 self) - Add to MetaCart
We present an efficient indexing method to locate 1-dimensional subsequences within a collection of sequences, such that the subsequences match a given (query) pattern within a specified tolerance. The idea is to map each data sequence into a small set of multidimensional rectangles in feature

Convolution Kernels on Discrete Structures

by David Haussler , 1999
"... We introduce a new method of constructing kernels on sets whose elements are discrete structures like strings, trees and graphs. The method can be applied iteratively to build a kernel on an infinite set from kernels involving generators of the set. The family of kernels generated generalizes the fa ..."
Abstract - Cited by 506 (0 self) - Add to MetaCart
the family of radial basis kernels. It can also be used to define kernels in the form of joint Gibbs probability distributions. Kernels can be built from hidden Markov random elds, generalized regular expressions, pair-HMMs, or ANOVA decompositions. Uses of the method lead to open problems involving

Regular expression pattern matching for XML

by Haruo Hosoya, Benjamin C. Pierce , 2003
"... We propose regular expression pattern matching as a core feature of programming languages for manipulating XML. We extend conventional pattern-matching facilities (as in ML) with regular expression operators such as repetition (*), alternation (|), etc., that can match arbitrarily long sequences of ..."
Abstract - Cited by 114 (8 self) - Add to MetaCart
We propose regular expression pattern matching as a core feature of programming languages for manipulating XML. We extend conventional pattern-matching facilities (as in ML) with regular expression operators such as repetition (*), alternation (|), etc., that can match arbitrarily long sequences

Indexing and Querying XML Data for Regular Path Expressions

by Quanzhong Li, Bongki Moon - IN VLDB , 2001
"... With the advent of XML as a standard for data representation and exchange on the Internet, storing and querying XML data becomes more and more important. Several XML query languages have been proposed, and the common feature of the languages is the use of regular path expressions to query XML ..."
Abstract - Cited by 343 (9 self) - Add to MetaCart
numbering scheme for elements. This numbering scheme quickly determines the ancestor-descendant relationship between elements in the hierarchy of XML data. We also propose several algorithms for processing regular path expressions, namely, (1) ##-Join for searching paths from an element to another

Compressed suffix arrays and suffix trees with applications to text indexing and string matching

by Roberto Grossi, Jeffrey Scott Vitter , 2005
"... The proliferation of online text, such as found on the World Wide Web and in online databases, motivates the need for space-efficient text indexing methods that support fast string searching. We model this scenario as follows: Consider a text T consisting of n symbols drawn from a fixed alphabet Σ. ..."
Abstract - Cited by 239 (20 self) - Add to MetaCart
The proliferation of online text, such as found on the World Wide Web and in online databases, motivates the need for space-efficient text indexing methods that support fast string searching. We model this scenario as follows: Consider a text T consisting of n symbols drawn from a fixed alphabet Σ

A System for Approximate Tree Matching

by Jason Tsong-Li Wang, Kaizhong Zhang, Karpjoo Jeong, Dennis Shasha , 1992
"... Ordered, labeled trees are trees in which each node has a label and the left-to-right order of its children (if it has any) is fixed. Such trees have many applications in vision, pattern recognition, molecular biology, programming compilation and natural language processing. Many of the applications ..."
Abstract - Cited by 70 (10 self) - Add to MetaCart
, and automatic error recovery and correction for programming languages. Previous systems use exact matching (or generalized regular expression matching) for tree comparison. This paper presents a system, called Approximate-Tree-By-Example (ATBE), which allows inexact matching of trees. The ATBE system interacts

Regular Expression Pattern Matching for XML

by Depar Tment Of Computer
"... We propose regular expression pattern matching as a core feature for programming languages for manipulating XML (and similar tree-structured data formats). We extend con-ventional pattern-matching facilities with regular expression operators uch as repetition (*), alternation (I), etc., that can mat ..."
Abstract - Add to MetaCart
We propose regular expression pattern matching as a core feature for programming languages for manipulating XML (and similar tree-structured data formats). We extend con-ventional pattern-matching facilities with regular expression operators uch as repetition (*), alternation (I), etc., that can

Matching Automata for Regular Patterns

by Michael Y. Levin, Benjamin C. Pierce - In International Conference on Functional Programming (ICFP , 2003
"... Pattern matching mechanisms based on regular expressions are featured in a number of recent languages for processing tree-structured data such as XML. A compiler for such a language must address all the familiar problems of pattern optimization in functional languages with ML-style algebraic datatyp ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Pattern matching mechanisms based on regular expressions are featured in a number of recent languages for processing tree-structured data such as XML. A compiler for such a language must address all the familiar problems of pattern optimization in functional languages with ML-style algebraic

Minimization of Tree Pattern Queries

by Sihem Amer-yahia, Sungran Cho, Laks V.S. Lakshmanan, Divesh Srivastava - In SIGMOD , 2001
"... Tree patterns form a natural basis to query tree-structured data such as XML and LDAP. Since the efficiency of tree pattern matching against a tree-structured database depends on the size of the pattern, it is essential to identify and eliminate redundant nodes in the pattern and do so as quickly as ..."
Abstract - Cited by 137 (4 self) - Add to MetaCart
Tree patterns form a natural basis to query tree-structured data such as XML and LDAP. Since the efficiency of tree pattern matching against a tree-structured database depends on the size of the pattern, it is essential to identify and eliminate redundant nodes in the pattern and do so as quickly
Results 1 - 10 of 1,404