the apostolico–giancarlo algorithm speeds up the process of checking whether a match has occurred at the given alignment by skipping explicit character comparisons. this uses information gleaned during the pre-processing of the pattern in conjunction with suffix match lengths recorded at each match attempt. storing suffix match lengths requires an additional table equal in size to the text being searched.