430 search results - page 1 / 86 » A New Linearizing Restriction in the Pattern Matching Proble... |
66
Voted
FCT
2005
Springer
15 years 3 months ago
2005
Springer
In the pattern matching problem, there can be a quadratic number of matching substrings in the size of a given text. The linearizing restriction finds, at most, a linear number of...
JUCS
2010
14 years 8 months ago
2010
Abstract: We study the number of matching substrings in the pattern matching problem. In general, there can be a quadratic number of matching substrings in the size of a given text...
91
Voted
JCO
2008
14 years 10 months ago
2008
We study variants of classical stable matching problems in which there is an additional requirement for a stable matching, namely that there should not be two participants who wou...
98
Voted
JUCS
2010
14 years 8 months ago
2010
: We consider the problem of efficiently evaluating a large number of XPath expressions, especially in the case when they define subscriber profiles for filtering of XML documen...
BMCBI
2008
14 years 10 months ago
2008
Background: In DNA microarray experiments, discovering groups of genes that share similar transcriptional characteristics is instrumental in functional annotation, tissue classifi...