A linear time algorithm for Shortest Cyclic Cover of Strings
Copyright policy )A linear time algorithm for Shortest Cyclic Cover of Strings
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- National Research Institute for Agriculture, Food and Environment France
- French Institute for Research in Computer Science and Automation France
- Département Sciences sociales, agriculture et alimentation, espace et environnement France
- Institut des sciences de l'information et de leurs interactions France
- University of Perpignan France
Overlap, superstring, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Superstring, Eulerian graph, Algorithms on strings, Graph, minimum assignment, Theoretical Computer Science, shortest cyclic cover of strings, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, overlap, Discrete Mathematics and Combinatorics, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM], Minimum assignment, 004, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], greedy algorithm, Computational Theory and Mathematics, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], Shortest cyclic cover of strings, Greedy
Overlap, superstring, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Superstring, Eulerian graph, Algorithms on strings, Graph, minimum assignment, Theoretical Computer Science, shortest cyclic cover of strings, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, overlap, Discrete Mathematics and Combinatorics, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM], Minimum assignment, 004, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], greedy algorithm, Computational Theory and Mathematics, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], Shortest cyclic cover of strings, Greedy
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).5 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!