The Copy Number Transformation Problem
summary
Defines copy-number profiles as integer vectors and operations as unit ±1 operations on contiguous intervals; proves each position needs at most max copy number N edits and shows deletions can be pushed early under the model. Builds a dynamic programming table over indices and edit counts, then compresses rows into piecewise-linear functions so the optimal distance and an optimal transformation are computable in linear time using constant space.
AI-written summary · about