The approximate period problem for DNA alphabet

Popov, Vladimir

doi:10.1016/s0304-3975(03)00211-1

Cited by 24 publications

(24 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For mobile robots, the problem of motion planning can be considered as the problem of generation of sequences of motor primitives. To solve this problem we can use different string problems and algorithms for these problems (see [19] - [32]). To improve the internal module we can use the model of one shot learning by imitation.…”

Section: The General System Of Motion Planningmentioning

confidence: 99%

A system of intelligent algorithms for a module of onboard equipment of mobile vehicles

Gorbenko¹

2013

ijma

View full text Add to dashboard Cite

show abstract

Section: The General System Of Motion Planningmentioning

confidence: 99%

A system of intelligent algorithms for a module of onboard equipment of mobile vehicles

Gorbenko¹

2013

ijma

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%

“…Each test was runned on a cluster of at least 100 nodes. Selected experimental results are given in Table 1. time average max best OA [1] 47.26 min 9.18 h 14.21 sec OA [2] 58.13 min 4.71 h 2.83 min …”

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

The approximate period problem for DNA alphabet

Abstract: We show that the approximate period problem for DNA alphabet is NP-complete.

Cited by 24 publications

References 6 publications

A system of intelligent algorithms for a module of onboard equipment of mobile vehicles

A system of intelligent algorithms for a module of onboard equipment of mobile vehicles

The string barcoding problem

The swap common superstring problem

Contact Info

Product

Resources

About