affno abstract
On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems2003· article· en· Journal of Computer and System Sciences· Computer Science
179
citations
Every work in the frame. Each row carries the routes that admitted it, because a frame that forgets how it found something cannot be audited.