This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
Given two planar polylines T and P with n and m edges, respectively, we present an Om2 n2 time, Omn space algorithm to nd portions of the text" T which are similar in sh...