Approximate Subset Matching with Don't Cares

A. Amihood, E Porat, M Lewenstein

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Original language	American English
Title of host publication	12th Annual ACM-SIAM Symposium On Discrete Algorithms (SODA)
Editors	SIAM Activity Group on Discrete Mathematics
Publisher	SIAM
State	Published - 2001

Place of conference:Washington, D.C.

Cite this

@inproceedings{6020bc79bcd5491998e5575e9d8a5584,

title = "Approximate Subset Matching with Don't Cares",

author = "A. Amihood and E Porat and M Lewenstein",

note = "Place of conference:Washington, D.C.",

year = "2001",

language = "American English",

editor = "Mathematics, {SIAM Activity Group on Discrete}",

booktitle = "12th Annual ACM-SIAM Symposium On Discrete Algorithms (SODA)",

publisher = "SIAM",

}

TY - GEN

T1 - Approximate Subset Matching with Don't Cares

AU - Amihood, A.

AU - Porat, E

AU - Lewenstein, M

N1 - Place of conference:Washington, D.C.

PY - 2001

Y1 - 2001

UR - https://scholar.google.co.il/scholar?q=Approximate+Subset+Matching+with+Don%E2%80%99t+Cares&btnG=&hl=en&as_sdt=0%2C5

M3 - Conference contribution

BT - 12th Annual ACM-SIAM Symposium On Discrete Algorithms (SODA)

A2 - Mathematics, SIAM Activity Group on Discrete

PB - SIAM

ER -