Inverted lists string pattern matching

Simple item page
dc.contributor.authorKhancome, Chouvalit
dc.contributor.authorBoonjing, Veera
dc.date.accessioned2026-08-06T09:58:47Z
dc.date.available2026-08-06T09:58:47Z
dc.date.issued2009-11-12
dc.description.abstractThis paper presents two algorithms of string pattern matching. These algorithms employ the inverted lists to accommodate the string pattern to be searched for. The first solution scans the text in a single pass for all occurrences of string pattern. The second solution, which improves the first one, takes the comparison times equal to the length of pattern plus the number of comparisons that lead to be mismatched. © 2009 IEEE.
dc.identifier.citationProceedings 2009 2nd IEEE International Conference on Computer Science and Information Technology Iccsit 2009, 623-627, 2009
dc.identifier.doi10.1109/ICCSIT.2009.5234774
dc.identifier.other2-s2.0-70449129862
dc.identifier.urihttps://dspace.kmitl.ac.th/handle/123456789/2641
dc.sourceProceedings 2009 2nd IEEE International Conference on Computer Science and Information Technology Iccsit 2009
dc.subjectInverted index
dc.subjectInverted lists (IVL)
dc.subjectString pattern matching
dc.titleInverted lists string pattern matching
dc.typeConference Paper

Files

Collections

Research