The shortest common superstring problem

Gorbenko, Anna; Popov, Vladimir

doi:10.12988/ams.2013.13212

Cited by 4 publications

(1 citation statement)

References 10 publications

(6 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The LCSS for the partition access queues of N criteria can be found in O(|V | N −1 ) time by an extension of the pairwise algorithm [26].…”

Section: Stop-and-share Schemementioning

confidence: 99%

I/O-Efficient Multi-Criteria Shortest Paths Query Processing on Large Graphs

Zhou,

Huang,

et al. 2024

IEEE Trans. Knowl. Data Eng.

View full text Add to dashboard Cite

Shortest path computation is a basic operation for many graph-based applications and has been extensively studied. However, most existing works only consider the optimal path of a single criterion but ignore real-world situations involving multiple criteria. This paper investigates a new Multi-Criteria Shortest Paths (MCSPs) problem, aiming to compute the shortest paths of all criteria between a vertex pair. It is significant for real-world applications such as GPS navigation and social network analysis. Nevertheless, the rapid growth of graph size or memory-limited devices poses a memory-constraint challenge, making the adaptation of existing methods extremely time-consuming. To solve the memory-constraint MCSPs problem, we propose a general STOP & SHARE scheme to synchronize the search speeds of all criteria for sharing partition accesses. Two algorithms called OHP and MHP, adopting the one-hop strategy and partition exhaustive strategy, respectively, are proposed for implementing our scheme. Moreover, we develop two optimized algorithms, BMHP and BMHPS, to improve query efficiency by combining MHP with the bidirectional technique and a novel in-partition shortcut optimization. We also investigate partition-oriented I/O management. Experimental studies on large real-world graphs demonstrate the effectiveness of the proposed methods over the multi-pass adaptations of the existing methods.

show abstract

“…The LCSS for the partition access queues of N criteria can be found in O(|V | N −1 ) time by an extension of the pairwise algorithm [26].…”

Section: Stop-and-share Schemementioning

confidence: 99%

I/O-Efficient Multi-Criteria Shortest Paths Query Processing on Large Graphs

Zhou,

Huang,

et al. 2024

IEEE Trans. Knowl. Data Eng.

View full text Add to dashboard Cite

show abstract

The shortest common ordered supersequence problem

Gorbenko¹

2013

ams

Self Cite

View full text Add to dashboard Cite

show abstract

On the shortest common parameterized supersequence problem

Gorbenko¹,

Popov²

2013

ams

Self Cite

View full text Add to dashboard Cite

In this paper, we consider the problem of the shortest common parameterized supersequence. In particular, we consider an explicit reduction from the problem to the satisfiability problem. Keywords: parameterized supersequence, satisfiability, NP-completeThe well-known problem of the shortest common supersequence (SCS) is a classical distance measure for strings. Another well-studied string comparison measure is that of parameterized matching, where two equal-length strings are a parameterized-match if there exists a bijection on the alphabets such that one string matches the other under the bijection (see e.g. [1,2]). For instance, it is considered the periodicity of parameterized strings. These results and some other studies about the periodicity of parameterized strings showed considerable differences between parameterized strings and ordinary strings.

show abstract

The shortest common superstring problem

Cited by 4 publications

References 10 publications

I/O-Efficient Multi-Criteria Shortest Paths Query Processing on Large Graphs

I/O-Efficient Multi-Criteria Shortest Paths Query Processing on Large Graphs

The shortest common ordered supersequence problem

On the shortest common parameterized supersequence problem

Contact Info

Product

Resources

About