Blue Jeans(最大匹配问题)

最新推荐文章于 2019-09-24 20:56:00 发布

原创

最新推荐文章于 2019-09-24 20:56:00 发布 · 1.3k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#STL #string #字符串

本文介绍了一个基于DNA序列比对的问题，旨在寻找多个DNA序列之间的最长共同子序列。通过使用C++标准库中的字符串操作，文章提供了一种有效的解决方案。

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.

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: