Fdtxjr

I’m planning on buying a laser printer but concerned about the life cycle of toner in the machine

How much RAM could one put in a typical 80386 setup?

Can a Warlock become Neutral Good?

How can bays and straits be determined in a procedurally generated map?

Arthur Somervell: 1000 Exercises - Meaning of this notation

Python: next in for loop

What are the differences between the usage of 'it' and 'they'?

Today is the Center

How old can references or sources in a thesis be?

Risk of getting Chronic Wasting Disease (CWD) in the United States?

Why dont electromagnetic waves interact with each other?

Approximately how much travel time was saved by the opening of the Suez Canal in 1869?

Why can't I see bouncing of a switch on an oscilloscope?

Accidentally leaked the solution to an assignment, what to do now? (I'm the prof)

Can I ask the recruiters in my resume to put the reason why I am rejected?

How to format long polynomial?

Why "Having chlorophyll without photosynthesis is actually very dangerous" and "like living with a bomb"?

Why did Neo believe he could trust the machine when he asked for peace?

How to find program name(s) of an installed package?

The use of multiple foreign keys on same column in SQL Server

How is it possible to have an ability score that is less than 3?

Why not use SQL instead of GraphQL?

Can I make popcorn with any corn?

Why are electrically insulating heatsinks so rare? Is it just cost?

Closest string attempted algorithm.

Confusion related to the definition of NP problemsFinding the closest point in a set to another point in n-dimensional space: efficientlyBasic encoding with math formulaFind points on $n$-dimensional grid within hypersphereequal hamming distance (or scalar product) between all pairsA communication complexity problem for finding near matchesA practical algorithm for finding distances of a set of strings?Proof of Validity of My Polynomial Time Algorithm for $co-NP$ Complete ProblemAttempted algorithm to find which shortest permutation of a string out of “hard.”Finding the numerical listed string to the center algorithm.

1

$begingroup$

In theoretical computer science, the closest string is an NP-hard
computational problem, which tries to find the geometrical center
of a set of input strings.

To understand the word "center", it is necessary to define a distance
between two strings. Usually, this problem is studied with the Hamming
distance in mind.-From wikipedia

From what I read there is some similarity between the one center problem and the closest string problem.

I've been studying the math behind the closest string and attempted an algorithm.

The algorithm takes input for a string's length for L, and the number
of strings altogether for X. The hamming distance is for input D.
Input Z calculates the exact amount of all possible characters in the
string besides the permutations for input D.

We get a set of Z amount of characters. We divide Z by D which is S.
We get B possible permutations of characters that can be generated in
a list of X strings. In other words, Z divided by Y groupings of the
same X should uniquely have B possible permutations within the Z
characters. (For the center numerical listed string based on hamming?)

If the algorithm is, correct (or I've misled). The center of Z is at
the S string which should be the B permutation.

The concept is to visualize our strings as a number line.

 Z = X * X * 1 * L + X * D * D * D + 1

 S = Z / D

 B = S / D

 Y = S / B

 CL = D * A ≤ X ≤ B * Y

 P=B*Y

Here is the checks for the aforementioned.

S = S * D / D

D = Z / S

The algorithm continues if I want to find the 2nd closest, 3rd closest and so on within the S amount that was permutated within hamming distance.

NQ = S / RT

P = RT * NQ

Check to see if P=NQ. If P=NQ then the algorithm should be correct.

Closest String Wiki

linear-algebra computational-complexity np-complete

share|cite|improve this question

edited Mar 22 at 21:59

Travis Wells

asked Mar 22 at 0:47

Travis WellsTravis Wells

196

$endgroup$

add a comment | 

1

$begingroup$

In theoretical computer science, the closest string is an NP-hard
computational problem, which tries to find the geometrical center
of a set of input strings.

To understand the word "center", it is necessary to define a distance
between two strings. Usually, this problem is studied with the Hamming
distance in mind.-From wikipedia

From what I read there is some similarity between the one center problem and the closest string problem.

I've been studying the math behind the closest string and attempted an algorithm.

The algorithm takes input for a string's length for L, and the number
of strings altogether for X. The hamming distance is for input D.
Input Z calculates the exact amount of all possible characters in the
string besides the permutations for input D.

We get a set of Z amount of characters. We divide Z by D which is S.
We get B possible permutations of characters that can be generated in
a list of X strings. In other words, Z divided by Y groupings of the
same X should uniquely have B possible permutations within the Z
characters. (For the center numerical listed string based on hamming?)

If the algorithm is, correct (or I've misled). The center of Z is at
the S string which should be the B permutation.

The concept is to visualize our strings as a number line.

 Z = X * X * 1 * L + X * D * D * D + 1

 S = Z / D

 B = S / D

 Y = S / B

 CL = D * A ≤ X ≤ B * Y

 P=B*Y

Here is the checks for the aforementioned.

S = S * D / D

D = Z / S

The algorithm continues if I want to find the 2nd closest, 3rd closest and so on within the S amount that was permutated within hamming distance.

NQ = S / RT

P = RT * NQ

Check to see if P=NQ. If P=NQ then the algorithm should be correct.

Closest String Wiki

linear-algebra computational-complexity np-complete

share|cite|improve this question

edited Mar 22 at 21:59

Travis Wells

asked Mar 22 at 0:47

Travis WellsTravis Wells

196

$endgroup$

add a comment | 

$begingroup$

In theoretical computer science, the closest string is an NP-hard
computational problem, which tries to find the geometrical center
of a set of input strings.

To understand the word "center", it is necessary to define a distance
between two strings. Usually, this problem is studied with the Hamming
distance in mind.-From wikipedia

From what I read there is some similarity between the one center problem and the closest string problem.

I've been studying the math behind the closest string and attempted an algorithm.

The algorithm takes input for a string's length for L, and the number
of strings altogether for X. The hamming distance is for input D.
Input Z calculates the exact amount of all possible characters in the
string besides the permutations for input D.

We get a set of Z amount of characters. We divide Z by D which is S.
We get B possible permutations of characters that can be generated in
a list of X strings. In other words, Z divided by Y groupings of the
same X should uniquely have B possible permutations within the Z
characters. (For the center numerical listed string based on hamming?)

If the algorithm is, correct (or I've misled). The center of Z is at
the S string which should be the B permutation.

The concept is to visualize our strings as a number line.

 Z = X * X * 1 * L + X * D * D * D + 1

 S = Z / D

 B = S / D

 Y = S / B

 CL = D * A ≤ X ≤ B * Y

 P=B*Y

Here is the checks for the aforementioned.

S = S * D / D

D = Z / S

The algorithm continues if I want to find the 2nd closest, 3rd closest and so on within the S amount that was permutated within hamming distance.

NQ = S / RT

P = RT * NQ

Check to see if P=NQ. If P=NQ then the algorithm should be correct.

Closest String Wiki

linear-algebra computational-complexity np-complete

share|cite|improve this question

edited Mar 22 at 21:59

Travis Wells

asked Mar 22 at 0:47

Travis WellsTravis Wells

196

$endgroup$

 Z = X * X * 1 * L + X * D * D * D + 1

 S = Z / D

 B = S / D

 Y = S / B

 CL = D * A ≤ X ≤ B * Y

 P=B*Y

NQ = S / RT

P = RT * NQ

share|cite|improve this question

edited Mar 22 at 21:59

Travis Wells

asked Mar 22 at 0:47

Travis WellsTravis Wells

196

share|cite|improve this question

edited Mar 22 at 21:59

Travis Wells

asked Mar 22 at 0:47

Travis WellsTravis Wells

196

asked Mar 22 at 0:47

Travis WellsTravis Wells

196

asked Mar 22 at 0:47

Travis WellsTravis Wells

196