Fast approximate pattern matching with few indels via embeddings

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Fast approximate pattern matching with few indels via embeddings

Full text

Pdf (75 KB)

Source

Symposium on Discrete Algorithms archive
Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms table of contents

New Orleans, Louisiana

SESSION: Session 8A table of contents

Pages: 651 - 652

Year of Publication: 2004

ISBN:0-89871-558-X

Authors

Mihai Bădoiu	MIT LCS, Cambridge, MA
Piotr Indyk	MIT LCS, Cambridge, MA

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Society for Industrial and Applied Mathematics Philadelphia, PA, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 18, Citation Count: 0

Additional Information:

references collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Piotr Indyk , Nick Koudas , S. Muthukrishnan, Identifying Representative Trends in Massive Time Series Data Sets Using Sketches, Proceedings of the 26th International Conference on Very Large Data Bases, p.363-372, September 10-14, 2000
	2	Howard Karloff, Fast algorithms for approximately counting mismatches, Information Processing Letters, v.48 n.2, p.53-60, Nov. 8, 1993 [doi>10.1016/0020-0190(93)90177-B]

Collaborative Colleagues:

Mihai Bădoiu: colleagues

Piotr Indyk: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player