Linear-time algorithm for finding approximate shortest common superstrings

被引：0

|

作者：

Ukkonen, Esko ^{[1
]}

机构：

[1] Univ of Helsinki, Finland

来源：

Algorithmica (New York) | 1990年 / 5卷 / 03期

关键词：

Approximation Algorithms - Greedy Heuristics - Hamilitonian Path;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

下载

收藏

页码：313 / 323

相关论文

共 50 条

[21] A simple linear-time algorithm for finding path-decompositions of small width
Cattell, K
Dinneen, MJ
Fellows, MR
INFORMATION PROCESSING LETTERS, 1996, 57 (04) : 197 - 203
[22] LINEAR-APPROXIMATION OF SHORTEST SUPERSTRINGS
BLUM, A
JIANG, T
LI, M
TROMP, J
YANNAKAKIS, M
JOURNAL OF THE ACM, 1994, 41 (04) : 630 - 647
[23] A LINEAR-TIME MEDIAN-FINDING ALGORITHM FOR PROJECTING A VECTOR ON THE SIMPLEX OF RN
MACULAN, N
DEPAULA, GG
OPERATIONS RESEARCH LETTERS, 1989, 8 (04) : 219 - 222
[24] Linear-time median-finding algorithm for projecting a vector on the simplex of Rn
Maculan, Nelson, 1600, (08):
[25] A linear-time ie algorithm for finding three-decompositions of small treewidth
Bodlaender, HL
SIAM JOURNAL ON COMPUTING, 1996, 25 (06) : 1305 - 1317
[26] NEW LINEAR-TIME ONLINE ALGORITHM FOR FINDING SMALLEST INITIAL PALINDROME OF A STRING
MANACHER, G
JOURNAL OF THE ACM, 1975, 22 (03) : 346 - 351
[27] Approximation Algorithm for the Shortest Approximate Common Superstring Problem
Rebai, A. S.
Elloumi, M.
PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 12, 2006, 12 : 302 - +
[28] Linear Kernels and Linear-Time Algorithms for Finding Large Cuts
Etscheid, Michael
Mnich, Matthias
ALGORITHMICA, 2018, 80 (09) : 2574 - 2615
[29] Linear Kernels and Linear-Time Algorithms for Finding Large Cuts
Michael Etscheid
Matthias Mnich
Algorithmica, 2018, 80 : 2574 - 2615
[30] Linear-time algorithm for the generation of trees
Algorithmica (New York), 1997, 17 (02):

← 1 2 3 4 5 →