Experimenting with Pattern Matching Algorithms

Simple item page
dc.contributor.authorManolopoulos, Yannisen_US
dc.contributor.authorFaloutsos, Christosen_US
dc.contributor.departmentISRen_US
dc.date.accessioned2007-05-23T09:56:34Z
dc.date.available2007-05-23T09:56:34Z
dc.date.issued1994en_US
dc.description.abstractTwo new pattern matching algorithms based on the Boyer-Moore algorithm are presented. Their performance is compared to that of earlier relevant variants in terms of the number of character comparisons and the required running time by exhaustive simulation. Experimental results show the efficiency of both these two new algorithms.en_US
dc.format.extent656504 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/5512
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1994-33en_US
dc.subjectalgorithmsen_US
dc.subjectdigital libraries text retrievalen_US
dc.subjectSystems Integrationen_US
dc.titleExperimenting with Pattern Matching Algorithmsen_US
dc.typeTechnical Reporten_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR_94-33.pdf
Size:
641.12 KB
Format:
Adobe Portable Document Format
Download

Collections

Institute for Systems Research Technical Reports