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 条

[41] A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes
Keshavarz-Kohjerdi, Fatemeh
Bagheri, Alireza
[J]. OPTIMIZATION METHODS & SOFTWARE, 2023, 38 (03): : 591 - 625
[42] A Linear-Time Algorithm for Finding Locally Connected Spanning Trees on Circular-Arc Graphs
Lin, Ching-Chi
Chen, Gen-Huey
Chang, Gerard J.
[J]. ALGORITHMICA, 2013, 66 (02) : 369 - 396
[43] A linear-time algorithm for finding all door locations that make a room searchable - (Extended abstract)
Zhang, John Z.
Kameda, Tsunehiko
[J]. THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2008, 4978 : 502 - +
[44] A LINEAR-TIME ALGORITHM FOR SEQUENTIAL DIAGNOSIS IN HYPERCUBES
KHANNA, S
FUCHS, WK
[J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1995, 26 (01) : 48 - 53
[45] A LINEAR-TIME ALGORITHM FOR ROUTING IN A CONVEX GRID
KAUFMANN, M
[J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1990, 9 (02) : 180 - 184
[46] A linear-time algorithm for studying genetic variation
Stojanovic, Nikola
Berman, Piotr
[J]. ALGORITHMS IN BIOINFORMATICS, PROCEEDINGS, 2006, 4175 : 344 - 354
[47] AN ALMOST LINEAR-TIME ALGORITHM FOR GRAPH REALIZATION
BIXBY, RE
WAGNER, DK
[J]. MATHEMATICS OF OPERATIONS RESEARCH, 1988, 13 (01) : 99 - 123
[48] LINEAR-TIME ONLINE RECOGNITION ALGORITHM FOR PALSTAR
GALIL, Z
SEIFERAS, J
[J]. JOURNAL OF THE ACM, 1978, 25 (01) : 102 - 111
[49] A Linear-Time Algorithm for Hamming Distance with Shifts
Minghui Jiang
[J]. Theory of Computing Systems, 2009, 44 : 349 - 355
[50] A Linear-Time Algorithm for Hamming Distance with Shifts
Jiang, Minghui
[J]. THEORY OF COMPUTING SYSTEMS, 2009, 44 (03) : 349 - 355

← 1 2 3 4 5 →