该博客介绍了一个ACM竞赛中的问题——POJ-3080 blue jeans，涉及寻找一组DNA碱基序列中的最长公共子序列。博主采用暴力搜索（BF算法）解决，虽然算法简单直接，但由于序列长度限制为60，因此不担心超时。文章提到了使用`<cstring>`库中的`strncpy()`, `strstr()`, `strcpy()`三个函数，并建议读者通过查阅资料加深理解。文章附有详细注释的代码实现。"
105944856,7528248,深入理解Android logcat命令,"['Android开发', '日志管理', '调试工具']
Description
The Genographic Project is a research partnership between IBM and The National Geographic Society that is analyzing DNA from hundreds of thousands of contributors to map how the Earth was populated.
As an IBM researcher, you have been tasked with writing a program that will find commonalities amongst given snippets of DNA that can be correlated with individual survey information to identify new genetic markers.
A DNA base sequence is noted by listing the nitrogen bases in the order in which they are found in the molecule. There are four bases: adenine (A), thymine (T), guanine (G), and cytosine (C). A 6-base DNA sequence could be represented as TAGACC.
Given a set of DNA base sequences, determine the longest series of bases that occurs in all of the sequences.
As an IBM researcher, you have been tasked with writing a program that will find commonalities amongst given snippets of DNA that can be correlated with individual survey information to identify new genetic markers.
A DNA base sequence is noted by listing the nitrogen bases in the order in which they are found in the molecule. There are four bases: adenine (A), thymine (T), guanine (G), and cytosine (C). A 6-base DNA sequence could be represented as TAGACC.
Given a set of DNA base sequences, determine the longest series of bases that occurs in all of the sequences.
Input
Input to this problem will begin with a line containing a single integer n indicating the number of datasets. Each dataset consists of the following components:
- A single p
最低0.47元/天 解锁文章
扫一扫
660
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
