An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions

Laurent Bulteau*, Mark Jones, Rolf Niedermeier, Till Tantau

*Corresponding author for this work

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

1 Citation (Scopus)
28 Downloads (Pure)

Fingerprint

Dive into the research topics of 'An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions'. Together they form a unique fingerprint.

INIS

Computer Science