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 条

[1] A LINEAR-TIME ALGORITHM FOR FINDING APPROXIMATE SHORTEST COMMON SUPERSTRINGS
UKKONEN, E
[J]. ALGORITHMICA, 1990, 5 (03) : 313 - 323
[2] A LINEAR-TIME ALGORITHM FOR FINDING AN AMBITUS
MISHRA, B
TARJAN, RE
[J]. ALGORITHMICA, 1992, 7 (5-6) : 521 - 554
[3] A GREEDY ALGORITHM FOR CONSTRUCTING SHORTEST COMMON SUPERSTRINGS
TARHIO, J
UKKONEN, E
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1986, 233 : 602 - 610
[4] A LINEAR-TIME ALGORITHM FOR FINDING A MINIMUM SPANNING PSEUDOFOREST
GABOW, HN
TARJAN, RE
[J]. INFORMATION PROCESSING LETTERS, 1988, 27 (05) : 259 - 263
[5] A linear-time algorithm for finding a maximal planar subgraph
Djidjev, Hristo N.
[J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2006, 20 (02) : 444 - 462
[6] LINEAR-TIME ALGORITHM FOR FINDING ALL FEEDBACK VERTICES
GAREY, MR
TARJAN, RE
[J]. INFORMATION PROCESSING LETTERS, 1978, 7 (06) : 274 - 276
[7] A LINEAR-TIME ALGORITHM FOR FINDING HAMILTONIAN CYCLES IN TOURNAMENTS
MANOUSSAKIS, Y
[J]. DISCRETE APPLIED MATHEMATICS, 1992, 36 (02) : 199 - 201
[8] A GREEDY APPROXIMATION ALGORITHM FOR CONSTRUCTING SHORTEST COMMON SUPERSTRINGS
TARHIO, J
UKKONEN, E
[J]. THEORETICAL COMPUTER SCIENCE, 1988, 57 (01) : 131 - 145
[9] Linear-Time Online Algorithm Inferring the Shortest Path from a Walk
Narisada, Shintaro
Hendrian, Diptarama
Yoshinaka, Ryo
Shinohara, Ayumi
[J]. STRING PROCESSING AND INFORMATION RETRIEVAL, SPIRE 2018, 2018, 11147 : 311 - 324
[10] A linear-time algorithm for finding optimal vehicle refueling policies
Department of Mathematics and Computer Science, Biola University, 13800 Biola Avenue, La Mirada, CA 90639, United States
[J]. Oper Res Lett, 2007, 3 (290-296):

← 1 2 3 4 5 →