Abstract
Given a pattern string P = p 1 p 2 ⋯ p m and K parallel text strings T = { T k = t 1 k ⋯ t n k | 1 ⩽ k ⩽ K } over an integer alphabet Σ, our task is to find the smallest integer κ > 0 such that P can be split into κ pieces P = P 1 … P κ , where each P i has an occurrence in some text track T k i and these partial occurrences retain the order. We study some variations of this minimum splitting problem, such as splittings with limited gaps and transposition invariance, and show how to use sparse dynamic programming to solve the variations efficiently. In particular, we show that the minimum splitting problem can be interpreted as a shortest path problem on line segments.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
