Sciweavers

215 search results - page 2 / 43
» On the Linear Number of Matching Substrings
Sort
View
LATA
2009
Springer
13 years 11 months ago
Counting Parameterized Border Arrays for a Binary Alphabet
The parameterized pattern matching problem is a kind of pattern matching problem, where a pattern is considered to occur in a text when there exists a renaming bijection on the alp...
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayu...
BMCBI
2007
106views more  BMCBI 2007»
13 years 4 months ago
Simultaneous identification of long similar substrings in large sets of sequences
Background: Sequence comparison faces new challenges today, with many complete genomes and large libraries of transcripts known. Gene annotation pipelines match these sequences in...
Jürgen Kleffe, Friedrich Möller, Burghar...
KAIS
2006
111views more  KAIS 2006»
13 years 4 months ago
Efficient string matching with wildcards and length constraints
This paper defines a challenging problem of pattern matching between a pattern P and a text T, with wildcards and length constraints, and designs an efficient algorithm to return e...
Gong Chen, Xindong Wu, Xingquan Zhu, Abdullah N. A...
INTERNET
2007
103views more  INTERNET 2007»
13 years 4 months ago
Publish-Subscribe Information Delivery with Substring Predicates
The content-based publish/subscribe (pub/sub)paradigm for system design is becoming increasingly popular, offering unique benefits for a large number of data-intensive applicatio...
Ioannis Aekaterinidis, Peter Triantafillou
PODS
2000
ACM
179views Database» more  PODS 2000»
13 years 9 months ago
Selectivity Estimation for Boolean Queries
In a variety of applications ranging from optimizing queries on alphanumeric attributes to providing approximate counts of documents containing several query terms, there is an in...
Zhiyuan Chen, Flip Korn, Nick Koudas, S. Muthukris...