Can I read ACM ICPC 2008 South America Contest Problems on EtoBox?
ACM ICPC 2008 South America Contest Problems by Phạm Hữu Thạnh Đạt is a document available to read on EtoBox.
What is ACM ICPC 2008 South America Contest Problems about?
The document describes an algorithmic problem involving finding the longest common subsequence between two DNA strings that satisfies an additional constraint. Specifically, it must find the longest common subsequence composed of common segments of length K or greater. It provides an example where the longest common subsequence is 7 characters long, but for K=3 it would be empty since the common segments are all too short. The input and output specifications are also described.
- Author
- Phạm Hữu Thạnh Đạt
- Language
- EN