Linear Time Algorithm for the Longest Common Repeat Problem

机译：最长共同重复问题的线性时间算法

获取原文

获取原文并翻译 | 示例

页面导航

摘要
著录项
相似文献
相关主题

摘要

Given a set of strings U = {T_1, T_2, ... , T_l}, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of U. We also consider reversed and reverse-complemented repeats as well as normal repeats. We present a linear time algorithm for the longest common repeat problem.

机译：给定一组字符串U = {T_1，T_2，...，T_l}，最长的公共重复问题是找到在U的每个字符串中至少出现两次的最长的公共子字符串。我们还考虑了反向和反向互补重复以及正常重复。我们提出了最长的常见重复问题的线性时间算法。

著录项

来源
《International Conference on String Processing and Information Retrieval(SPIRE 2004); 20041005-08; Padova(IT)》|2004年|P.10-17|共8页
会议地点 Padova(IT)
作者
Inbok Lee; Costas S. Iliopoulos; Kunsoo Park;
展开▼
作者单位

School of Computer Science and Engineering Seoul National University Seoul, Korea;

展开▼
会议组织
原文格式 PDF
正文语种 eng
中图分类数据备份与恢复;
关键词

相似文献

外文文献
中文文献
专利

1. Linear time algorithms for finding and representing all the tandem repeats in a string [J] . Gusfield D, Stoye J Journal of computer and system sciences . 2004,第4期

机译：查找和表示字符串中所有串联重复序列的线性时间算法
2. Linear Time Algorithms for Generalizations of the Longest Common Substring Problem [J] . Michael Arnold, Enno Ohlebusch Algorithmica . 2011,第4期

机译：最长公共子串问题的推广的线性时间算法
3. An almost-linear time and linear space algorithm for the longest common subsequence problem [J] . J.Y. Guo, F.K. Hwang Information Processing Letters . 2005,第3期

机译：最长公共子序列问题的近似线性时间和线性空间算法
4. Linear Time Algorithm for the Generalised Longest Common Repeat Problem [C] . Inbok Lee, Yoan Jose Pinzon Ardila International Conference on String Processing and Information Retrieval(SPIRE 2005); 20051102-04; Buenos Aires(AR) . 2005

机译：广义最长共同重复问题的线性时间算法
5. Frequency Domain System Identification of Linear Time-Invariant Single-Input Single-Output 2-Dimensional Systems and Multi-Input Multi-Output 1-Dimensional Systems by Utilizing AFD Type Algorithms [D] . Wang, Xiaoyin. 2020

机译：通过利用AFD型算法，频域系统识别线性时间不变的单输入单输出二维系统和多输入多输出1维系统
6. Bounds and Algorithms for Fast Exact Searches of Chemical Fingerprints in Linear and Sub-Linear Time [O] . S. Joshua Swamidass, Pierre Baldi -1

机译：在线性和亚线性时间内快速精确搜索化学指纹的界限和算法
7. Linear time algorithm for the longest common repeat problem [O] . Lee, Inbok, Iliopoulos, Costas S., Park, Kunsoo 2007

机译：最长共同重复问题的线性时间算法

Linear Time Algorithm for the Longest Common Repeat Problem

摘要

著录项

相似文献

相关主题

期刊订阅