Consider the following problem. I have a pattern $P$ of length $100$ and a text $T$ of length $n$. I want to find the minimum number of operations to transform $P$ into $T$. The operations are:
- Insert a single character into $P$
- Delete a single character from $P$
- Substitute a single character in $P$ for another one
- Move an entire substring of $P$ to another location in $P$
What is the time complexity of this problem?