Verifying candidate matches in sparse and wildcard matching

Richard Cole, Ramesh Hariharan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The results on pattern matching problems in which the text has length n and the pattern has length m were obtained. Thus, the crucial new idea underlying the first three results given was that of confirming matches by convolving vectors obtained by coding characters in the alphabet with non-boolean entries. While the fourth result was a simpler method of shifting characters which ensures that each character occurs as a singleton in some shift.

Original languageEnglish (US)
Title of host publicationConference Proceedings of the Annual ACM Symposium on Theory of Computing
Pages592-601
Number of pages10
StatePublished - 2002
EventProceedings of the 34th Annual ACM Symposium on Theory of Computing - Montreal, Que., Canada
Duration: May 19 2002May 21 2002

Other

OtherProceedings of the 34th Annual ACM Symposium on Theory of Computing
CountryCanada
CityMontreal, Que.
Period5/19/025/21/02

Fingerprint

Pattern matching

ASJC Scopus subject areas

  • Software

Cite this

Cole, R., & Hariharan, R. (2002). Verifying candidate matches in sparse and wildcard matching. In Conference Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 592-601)

Verifying candidate matches in sparse and wildcard matching. / Cole, Richard; Hariharan, Ramesh.

Conference Proceedings of the Annual ACM Symposium on Theory of Computing. 2002. p. 592-601.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Cole, R & Hariharan, R 2002, Verifying candidate matches in sparse and wildcard matching. in Conference Proceedings of the Annual ACM Symposium on Theory of Computing. pp. 592-601, Proceedings of the 34th Annual ACM Symposium on Theory of Computing, Montreal, Que., Canada, 5/19/02.
Cole R, Hariharan R. Verifying candidate matches in sparse and wildcard matching. In Conference Proceedings of the Annual ACM Symposium on Theory of Computing. 2002. p. 592-601
Cole, Richard ; Hariharan, Ramesh. / Verifying candidate matches in sparse and wildcard matching. Conference Proceedings of the Annual ACM Symposium on Theory of Computing. 2002. pp. 592-601
@inproceedings{a1fd61326ce24f889733e58741ee092b,
title = "Verifying candidate matches in sparse and wildcard matching",
abstract = "The results on pattern matching problems in which the text has length n and the pattern has length m were obtained. Thus, the crucial new idea underlying the first three results given was that of confirming matches by convolving vectors obtained by coding characters in the alphabet with non-boolean entries. While the fourth result was a simpler method of shifting characters which ensures that each character occurs as a singleton in some shift.",
author = "Richard Cole and Ramesh Hariharan",
year = "2002",
language = "English (US)",
pages = "592--601",
booktitle = "Conference Proceedings of the Annual ACM Symposium on Theory of Computing",

}

TY - GEN

T1 - Verifying candidate matches in sparse and wildcard matching

AU - Cole, Richard

AU - Hariharan, Ramesh

PY - 2002

Y1 - 2002

N2 - The results on pattern matching problems in which the text has length n and the pattern has length m were obtained. Thus, the crucial new idea underlying the first three results given was that of confirming matches by convolving vectors obtained by coding characters in the alphabet with non-boolean entries. While the fourth result was a simpler method of shifting characters which ensures that each character occurs as a singleton in some shift.

AB - The results on pattern matching problems in which the text has length n and the pattern has length m were obtained. Thus, the crucial new idea underlying the first three results given was that of confirming matches by convolving vectors obtained by coding characters in the alphabet with non-boolean entries. While the fourth result was a simpler method of shifting characters which ensures that each character occurs as a singleton in some shift.

UR - http://www.scopus.com/inward/record.url?scp=0036036814&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036036814&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0036036814

SP - 592

EP - 601

BT - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

ER -