Dynamic multiple pattern matching

Simple item page
dc.contributor.advisorSchaffer, Alejandro A.en_US
dc.creatorIdury, Ramana Murthyen_US
dc.date.accessioned2009-06-04T00:03:29Zen_US
dc.date.available2009-06-04T00:03:29Zen_US
dc.date.issued1994en_US
dc.description.abstractPattern matching algorithms are among the most important and practical contribution of theoretical computer science. Pattern matching is used in a wide variety of applications such as text editing, information retrieval, DNA sequencing, and computer vision. Several combinatorial problems arise in pattern matching such as matching in the presence of local errors, scaling, rotation, compression, and multiple patterns. A common feature shared by many solutions to these problems is the notion of preprocessing the patterns and/or texts prior to the actual matching. We study the problem of pattern matching with multiple patterns. The set of patterns is called a dictionary. Furthermore, the dictionary can be dynamic in the sense that it can change over time by insertion or deletion of individual patterns. We need to preprocess the dictionary so as to provide efficient searching as well as efficient updates. We first present a solution to the one dimensional version of the problem where the patterns are strings. A salient feature of our solution is a DFA-based searching mechanism similar to the Knuth-Morris-Pratt algorithm. We then use this solution to solve the two dimensional version of the problem where the patterns are restricted to have square shapes. Finally we solve the general case, where the patterns can have any rectangular shape, by reducing this problem to a range searching problem in computational geometry.en_US
dc.format.extent110 p.en_US
dc.format.mimetypeapplication/pdfen_US
dc.identifier.callnoTHESIS COMP.SCI. 1994 IDURYen_US
dc.identifier.citationIdury, Ramana Murthy. "Dynamic multiple pattern matching." (1994) Diss., Rice University. <a href="https://hdl.handle.net/1911/16740">https://hdl.handle.net/1911/16740</a>.en_US
dc.identifier.urihttps://hdl.handle.net/1911/16740en_US
dc.language.isoengen_US
dc.rightsCopyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder.en_US
dc.subjectComputer scienceen_US
dc.subjectMathematicsen_US
dc.subjectMolecular biologyen_US
dc.subjectBiologyen_US
dc.titleDynamic multiple pattern matchingen_US
dc.typeThesisen_US
dc.type.materialTexten_US
thesis.degree.departmentComputer Scienceen_US
thesis.degree.disciplineEngineeringen_US
thesis.degree.grantorRice Universityen_US
thesis.degree.levelDoctoralen_US
thesis.degree.nameDoctor of Philosophyen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
9514190.PDF
Size:
4.04 MB
Format:
Adobe Portable Document Format
Download
Collections
Rice University Theses and Dissertations