On the shortest common parameterized supersequence problem

Gorbenko, Anna; Popov, Vladimir

doi:10.12988/ams.2013.36322

Search citation statements

Order By: Relevance

Paper Sections

Select...

Other1

It Is Easy To Check That There Is a String S Such That1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2013

Publication Types

Select...

Article5

Relationship

Self Cite2

Independent3

Authors

Journals

Cited by 7 publications

(7 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have considered our genetic algorithms OA [1] (see [39]) and OA [2] (see [40]) for SAT. We have used heterogeneous cluster.…”

Section: S[jt[4]]=a T[5] (¬Z[i J S T[1]] ∨ ¬Y[t[1] T[2]] ∨ W[i mentioning

confidence: 99%

The string barcoding problem

Gorbenko¹,

Popov²

2013

ams

View full text Add to dashboard Cite

show abstract

“…We have considered our genetic algorithms OA [1] (see [39]) and OA [2] (see [40]) for SAT. We have used heterogeneous cluster.…”

Section: S[jt[4]]=a T[5] (¬Z[i J S T[1]] ∨ ¬Y[t[1] T[2]] ∨ W[i mentioning

confidence: 99%

The string barcoding problem

Gorbenko¹,

Popov²

2013

ams

View full text Add to dashboard Cite

show abstract

“…We have considered our genetic algorithms OA [1] (see [38]) and OA [2] (see [39]) for SAT. For solution of SWCS, we have used heterogeneous cluster.…”

Section: It Is Easy To Check That There Is a String S Such Thatmentioning

confidence: 99%

The swap common superstring problem

Gorbenko¹,

Popov²

2013

ams

View full text Add to dashboard Cite

In this paper we consider an approach to solve the swap common superstring problem. This approach is based on an explicit reduction from the problem to the satisfiability problem.Keywords: swap common superstring, NP-complete, satisfiabilityThe algorithmic aspects of different problems of finding regularities are thoroughly studied in theoretical computer science (see e.g. [1] -[15]). In particular, the swap common superstring problem was proposed in [16].be a collection of strings over Σ. For simplicity, we use S[i] to denote the ith letter in string S, and S [i, j] to denote the substring of S consisting of the ith letter through the jth letter. The length of a string S is the number of letters in it and is denoted as |S|. Let 610 A. Gorbenko and V. PopovThe decision version of the swap common superstring problem can be formulated as following. The swap common superstring problem (SWCS):Instance: A collection S of strings over Σ, a string T , and a positive integer k.Question: Is there a string S such thatfor all 1 ≤ i < |S|, andThe problem SWCS is NP-hard [16]. Encoding different hard problems as instances of SAT and solving them with efficient satisfiability algorithms has caused considerable interest (see e.g. [17] -[36]). In this paper, we consider an approach to solve the SWCS problem. Our approach is based on an explicit reduction from the problem to the satisfiability problem.Let

show abstract

“…In particular, we can mention such problems as the set of parameterized k-covers problem [3], different problems of sensor placement (see e.g. [4] - [9]), the binary paint shop problem [10], various problems of bioinformatics (see e.g.…”

mentioning

confidence: 99%