@inproceedings{581d8acc6a484a16b5eed46a4d445738,

title = "Looking for MUM and DAD: Text-text comparisons do help",

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.",

author = "Mike Paterson and Shlomit Tassa and Uri Zwick",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1995.; 15th Conference on Foundations of Software Technology and Theoretical Computer Science, FST and TCS 1995 ; Conference date: 18-12-1995 Through 20-12-1995",

year = "1995",

doi = "10.1007/3-540-60692-0_36",

language = "אנגלית",

isbn = "3540606920",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "1--10",

editor = "P.S. Thiagarajan",

booktitle = "Foundations of Software Technology and Theoretical Computer Science - 15th Conference, Proceedings",

}