Looking for MUM and DAD: Text-text comparisons do help

Mike Paterson, Shlomit Tassa, Uri Zwick

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

It is known that about (Formula presented) comparisons are needed, in the worst case, to find all the occurrences of the string aba in a text of length n if only pattern-text comparisons are allowed. We show that if text-text comparisons can be used then only about (Formula presented) comparisons are required. This gives the first example in which text-text comparisons provably help.

Original languageEnglish
Title of host publicationFoundations of Software Technology and Theoretical Computer Science - 15th Conference, Proceedings
EditorsP.S. Thiagarajan
PublisherSpringer Verlag
Pages1-10
Number of pages10
ISBN (Print)3540606920, 9783540606925
DOIs
StatePublished - 1995
Event15th Conference on Foundations of Software Technology and Theoretical Computer Science, FST and TCS 1995 - Bangalore, India
Duration: 18 Dec 199520 Dec 1995

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1026
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference15th Conference on Foundations of Software Technology and Theoretical Computer Science, FST and TCS 1995
Country/TerritoryIndia
CityBangalore
Period18/12/9520/12/95

Fingerprint

Dive into the research topics of 'Looking for MUM and DAD: Text-text comparisons do help'. Together they form a unique fingerprint.

Cite this