The minimum test collection problem

Gorbenko, Anna; Popov, Vladimir

doi:10.12988/ams.2013.13108

Cited by 7 publications

(7 citation statements)

References 7 publications

(3 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In particular, encoding different hard problems as instances of different variants of the satisfiability problem and solving them with very efficient satisfiability algorithms has caused considerable interest (see e.g. [11] - [29]). Given sequences S 1 and S 2 over some fixed alphabet Σ ∪ Π, the longest common parameterized subsequence (LCPS) problem asks for a longest sequence T that is a parameterized subsequence of S 1 and S 2 .…”

Section: Question: Is There a Sequence T |T | ≤ K That Is A Paramementioning

confidence: 99%

The shortest common parameterized supersequence problem

Gorbenko¹,

Popov²

2013

ams

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

Section: Question: Is There a Sequence T |T | ≤ K That Is A Paramementioning

confidence: 99%

The shortest common parameterized supersequence problem

Gorbenko¹,

Popov²

2013

ams

View full text Add to dashboard Cite

show abstract

“…Encoding different hard problems as instances of different variants of the satisfiability problem and solving them with very efficient satisfiability algorithms has caused considerable interest (see e.g. [8] - [12]). We consider an explicit reduction from SCS to the satisfiability problem.…”

Section: Question: Is There S Such That |S| ≤ K and S Is A Superstrinmentioning

confidence: 99%

The shortest common superstring problem

Gorbenko¹,

Popov²

2013

ams

View full text Add to dashboard Cite

We consider the problem of the shortest common superstring. We describe an approach to solve the problem. This approach is based on an explicit reduction from the problem to the satisfiability problem.Keywords: shortest common superstring, satisfiability, NP-complete Investigation of different regularities can be used to retrieve various important knowledge (see e.g. [1] -[6]). In particular, different variants of the shortest common superstring problem play important roles in data compression and DNA sequencing. There are a number of variants of the shortest common superstring problem which are also of considerable interest for investigations.Let U, V , X, and Y be some strings such that U = XV Y . Then U is a superstring of V . The length of a string S is the number of letters in it and is denoted as |S|. Let Σ = {a 1 , . . . , a m } be a finite alphabet. Let S = {S 1 , . . . , S n } be a collection of strings over Σ. A string S is a superstring The problem SCS is NP-complete [7]. Encoding different hard problems as instances of different variants of the satisfiability problem and solving them with very efficient satisfiability algorithms has caused considerable interest (see e.g. [8] -[12]). We consider an explicit reduction from SCS to the satisfiability problem. Let

show abstract

“…Note that encoding different hard problems as instances of SAT and solving them with efficient satisfiability algorithms has caused considerable interest (see e.g. [9] - [20]). In this paper, we consider an approach to solve the RCSstr problem.…”

mentioning

confidence: 99%

Restricted common superstrings

Gorbenko¹,

Popov²

2013

ams

View full text Add to dashboard Cite

In this paper we consider an approach to solve the restricted common superstring problem. This approach is based on an explicit reduction from the problem to the satisfiability problem.Keywords: restricted common superstring, NP-complete, satisfiabilityComputational complexity of different problems of finding regularities and efficient algorithms for these problems are thoroughly studied in theoretical computer science (see e.g. [1] -[6]). In particular, complexity of the restricted common superstring problem and some approximation algorithms for the problem was considered in [7,8].Let Σ = {a 1 , . . . , a m } be a finite alphabet. Let S = {S 1 , . . . , S n } be a set of strings over Σ. We assume that S[i] is the ith letter in string S. Also, we assume that S [i, j] is 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. We assume that |S| is the length of S. We use #occ(X, Y ) to denote |{i | X = Y [i, j]}|.

show abstract

The minimum test collection problem

Abstract: In this paper we consider an approach to solve the minimum test collection problem. This approach is based on an explicit reduction from the problem to the satisfiability problem.

Cited by 7 publications

References 7 publications

The shortest common parameterized supersequence problem

The shortest common parameterized supersequence problem

The shortest common superstring problem

Restricted common superstrings

Contact Info

Product

Resources

About