每日算法1 —— UVa1584 环状序列 Circular Sequence

天使Di María

于 2023-01-14 00:20:47 发布

阅读量96

点赞数 1

分类专栏：算法文章标签：算法

本文链接：https://blog.csdn.net/m0_51339444/article/details/128681138

版权

算法专栏收录该内容

94 篇文章 15 订阅 ¥29.90 ¥99.00

订阅专栏

超级会员免费看

该博客介绍了如何从环状DNA序列中找到字典序最小的线性表示。它提供了一个算法问题，要求在给定的环状序列中找到一个线性序列，该序列在所有可能的切口中是最小的。博客包含输入和输出描述，并提供了C/C++和Python的解题思路。

摘要由CSDN通过智能技术生成

一、Question

下面是原题描述👇

1. 题目描述

Some DNA sequences exist in circular forms as in the following figure, which shows a circular sequence “CGAGTCAGCT”, that is, the last symbol “T” in “CGAGTCAGCT” is connected to the first symbol “C”. We always read a circular sequence in the clockwise direction. Since it is not easy to store a circular sequence in a computer as it is, we decided to store it as a linear sequence. However, there can be many linear sequences that are obtained from a circular sequence by cutting any place of the circular sequence. Hence, we also decided to store the linear sequence that is lexicographically smallest among all linear sequences that can be obtained from a circular sequence.